[Jul 22] Depth lower bounds for Stabbing Planes for combinatorial principles. Mathematical Approaches to Lower Bounds: Complexity of Proofs and Computation. Edinburgh (International Centre for Mathematical Sciences)

[Jun 22] Complexity theory with a human face (Czech Academy of Sciences). Prague

[Feb 20] Workshop22 on SAT Interactions. Dagstuhl Leibniz Center (DE).

[Jan 20]. Resolution and the binary encodings of combinatorial principles. Banff Workshop on Proof Complexity. BIRS Workshop Banff (CA).

[Jan 20]. Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs. Banff Workshop on Proof Complexity. BIRS Workshop Banff (CA).

[Sep 19] Complexity of Proofs From Structural Graph Theory. XXII Congresso dell'Unione Matematica Italiana. Session of Mathematical Logic (Pavia, IT).

[Jul 19]. Resolution and the complexity of the binary combinatorial principles. Conference on Computational Complexity.

[Sep 18] Cops-Robber Games and the Resolution Complexity of Tseitin Formulas. Graph Searching: Theory and Applications (GRASTA) workshop (TU -Berlin) (DE).

[Jul 18] Space Proof Complexity beyond Resolution. SAT-LICS Workshop in Proof Complexity, (Oxford University).

[Jul 18] Proof Complexity of k-Clique Principles. Workshop on Ramsey Theory and Computability. Notre Dame University.

[Jun 17] Refuting random 3CNF's using polynomials requires large proof space. Technion. Isarel

[Sep 16] Two problems on space complexity of Cutting Planes proof system. Workshop on SAT Interactions. Dagsthul Leibniz Center.

[Aug 16] What you can do with 5 linear inequalities. Workshop on Theoretical foundations of SAT solving. Fields Institute Toronto.

[Dec 15] Space proof Complexity for Random kCNFs and Hall's theorem. Simons Institute For Theory of Computing.

[Jan 14] Space complexity in algebraic proof systems. Workshop on Theoretical Foundations of Applied SAT Solving. BIRS Research Center. Banff (CA)

[Mar 12] Proof Complexity of Paris-Harrington Tautologies. Workshop Logical Approaches to Barriers in Complexity II. Isaac Newton Institute for Mathematical Sciences, Cambridge.

[Oct 11] Some results on the complexity of proofs in parameterized Resolution. Workshop on Proof Complexity. BIRS Research Center. Banff (CA).

[Feb 10] The strength of treelike parameterized resolution. Workshop on Circuits Logic and Games. Dagstuhl Leibniz Center (DE).

[Aug 10] The Complexity of Proofs in Parameterized Resolution. Workshop Parameterized Complexity of Computational Reasoning. MFCS+CSL 2010. Brno (CR).

[Jul 10] The Complexity of Proofs in Parameterized Resolution. Workshop n Propositional Proof Complexity: Theory and Practice. FLOC 2010. Edinburgh (UK).

[Aug 09] Workshop Barriers in Computational Complexity Workshop. Center For Computational Intractability. Princeton University. Princeton.

[Mar 06] Workshop on Complexity of Boolean Functions. Dagstuhl Leibniz Center (DE)

[Apr 05] Resolution by Pebbling Games. Workshop New directions in Proof Complexity. Isaac Newton Institute for Mathematical Sciences, Cambridge.(UK)

[Jun 03] Space Complexity of Random Formulae in Resolution. Workshop on Randomized Graphs and Algorithms. Bertinoro Research Center (IT).

[Mar 03] Workshop The Propositional Satisfiability Problem -- Algorithms and Lower Bounds. Dagstuhl Leibniz Center (DE).

[Mar 02] Workshop Complexity of Boolean Functions Workshop. Dagstuhl Leibniz Center (DE)

[Oct 01] Workshop on Circuit and Proof Complexity. International Center for Mathematical Study. Edinburgh (UK).

[Oct 01]. Resolution space for random k-CNFs. Workshop on Circuit and Proof Complexity. International Center for Mathematical Study. Edinburgh (UK).

[Dec 00]. Monotone simulations of nonmonotone proofs. Workshop on Proofs and Computations. Institute for Advanced Study. Princeton. (US).

[Jun 99]. Optimality of Size-Width Tradeoffs for Resolution. Workshop on Logical Complexity Theory. Ludwig-Maximilians-Universitat Munchen. Munich (DE)