|
Some talks I gave
|
|
Proof Complexity and Its Relations to SAT-Solving. Talk I gave at 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025), Jena, Germany, March 2025.
|
|
Algorithmic
Complexity of Certified Unsatisfiability (I.e., Complexity of Proof
Search). Talk I gave at 26th International Conference on Theory
and Applications of Satisfiability Testing (SAT 2023), Alghero, Italy,
July 2023.
|
|
Automating
Resolution is NP-Hard. Talk I gave at 60th Annual IEEE Symposium on Foundations
of Computer Science (FOCS 2019),
Baltimore, Maryland, USA, November 2019.
|
|
Limits of Linear and Semidefinite Relaxations for Combinatorial Problems. Talk I gave at Discrete Mathematics Days (DMD 2018), Sevilla, Spain, June 2018.
|
|
Selected
Topics on Semi-Algebraic Proof Complexity. Talk I gave at Workshop
on Proof Complexity and Beyond, Oberwolfach Research Institute
for Mathematics, Oberwolfach, Germany, August 2017.
|
|
Gaps Between
Classical Satisfiability Problems and Their Quantum
Relaxations. Talk I gave at Workshop on Graph Theory and
Combinatorics at Foundations of Computational Mathematics (FOCM 2017),
Barcelona, Spain, July 2017.
|
|
On Continuous and Combinatorial
Relaxations of Graph Isomorphism. I gave variants of this talk
several times with different titles; this one is the version I gave at
the theory of computing seminar at Technion, Israel, February 2014.
|
|
Mini-Tutorial on Semi-Algebraic Proof Systems. I gave this talk at the BIRS Workshop on Theoretical Foundations of Applied SAT Solving, Banff, Canada, January 2014.
|
|
Weak Pigeonhole Principles, Circuits for Approximate Counting, and Bounded-Depth Proofs. This is a (biased) survey talk on the topics of the title. I gave this talk at the theory of computing seminar at Tsinghua University, Beijing, China, July 2014.
|
|
Service in journal editorial boards
|
|
|
|
Service in conference program committees
|
- 50th EATCS International Colloquium on Automata, Languages, and Programming (ICALP 2023)
- 28th EACSL Annual Conference on Computer Science Logic (CSL 2020)
- 32nd Annual ACM/IEEE Symposium on Logic in Computer Science
(LICS 2017)
- 31st Annual ACM/IEEE Symposium on Logic in Computer Science
(LICS 2016)
- 24th EACSL Annual Conference on Computer Science Logic (CSL 2015)
- 16th International Workshop on Logic and Computational Complexity
(LCC 2015)
(co-chair)
- 42th EATCS International Colloquium on Automata, Languages, and Programming
(ICALP
2015).
- 39th International Symposium on Mathematical
Foundations of Computer Science
(MFCS 2014).
- 20th Workshop on Logic, Language, Information and Computation
(WOLLIC 2013).
- 39th EATCS
International Colloquium on Automata, Languages and Programming
(ICALP
2012).
- 26th IEEE Conference on Computational Complexity
(CCC
2011).
- Computability in Europe 2011: Models of Computation in
Context (CiE
2011).
- ASL European Summer Meeting, Logic Colloquium
2010. (LC 2010).
- 25th Annual IEEE Symposium on Logic in Computer Science (LICS 2010).
- 11th International Workshop on Logic and Computational Complexity
(LCC 2009).
- 36th EATCS
International Colloquium on Automata, Languages and Programming
(ICALP 2009).
- 12th
International Conference on Database Theory (ICDT 2009).
- 23rd IEEE
Conference on Computational Complexity (CCC 2008).
- 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).
- 11th International Conference on Database Theory (ICDT 2007).
- 7th
International Workshop on Logic and Computational Complexity (LCC 2005).
- 14th EACSL Annual Conference on Computer Science Logic (CSL
2005).
- Computability in Europe 2005: New Computational
Paradigms (CiE 2005).
- 31st EATCS International Colloquium on Automata, Languages and Programming
(ICALP 2004).
- 19th Annual IEEE Symposium on Logic in Computer Science (LICS 2004).
- Kalmár Workshop on Logic and Computer Science (2003).
|