Full-length versions of these articles are available on request.
Jan Elffers, Jesús Giráldez-Cru, Jakob Nordström, and Marc Vinyals. Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers. In Proceedings of the 21st International Conference on Theory and Applications of Satisfiability Testing (SAT 2018), July 2018.
Marc Vinyals, Jan Elffers, Jesús Giráldez-Cru, Stephan Gocht, and Jakob Nordström. In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving. In Proceedings of the 21st International Conference on Theory and Applications of Satisfiability Testing (SAT 2018), July 2018.
Massimo Lauria, Jan Elffers, Jakob Nordström, and Marc Vinyals. CNFgen: A generator of crafted benchmarks. In Proceedings of the 20th International Conference on Theory and Applications of Satisfiability Testing (SAT 2017), August 2017.
Joël Alwen, Susanna F. de Rezende, Jakob Nordström, and Marc Vinyals. Cumulative Space in Black-White Pebbling and Resolution. In Proceedings of the 8th Innovations in Theoretical Compter Science (ITCS 2017) conference, January 2017.
Susanna F. de Rezende, Jakob Nordström, and Marc Vinyals. How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity). In Proceedings of the 57th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2016), October 2016.
Jan Elffers, Jan Johannsen, Massimo Lauria, Thomas Magnard, Jakob Nordström and Marc Vinyals. Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers. In Proceedings of the 19th International Conference on Theory and Applications of Satisfiability Testing (SAT 2016), July 2016.
Siu Man Chan, Massimo Lauria, Jakob Nordström, and Marc Vinyals. Hardness of Approximation in PSPACE and Separation Results for Pebble Games. In Proceedings of the 56th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2015), October 2015.
Yuval Filmus, Massimo Lauria, Mladen Mikša, Jakob Nordström, and Marc Vinyals. From Small Space to Small Width in Resolution. ACM Transactions on Computational Logic (TOCL), November 2015.
Yuval Filmus, Massimo Lauria, Mladen Mikša, Jakob Nordström, and Marc Vinyals. Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds. In Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP 2013), July 2013.
A Proof Complexity View of Pseudo-Boolean Solving. Talk given at the Theory and Practice of Satisfiability Solving Workshop, Casa Matemática Oaxaca, August 2018. Video.
In Between Resolution and Cutting Planes: Proof Systems for Pseudo-Boolean SAT Solving. Talk given at the Proof Complexity Workshop, Dagstuhl, February 2018.
CNFgen: A generator of crafted CNF formulas. Talk given at SAT 2017, Melbourne, August 2017.
In Between Resolution and Cutting Planes: Proof Systems for Pseudo-Boolean SAT Solving. Talk given at PoCR 2017, Melbourne, August 2017.
How Limited Interaction Hinders Real Communication (and What it Means for Proof and Circuit Complexity). Talk given at the Proof Complexity and Beyond Workshop, Oberwolfach, August 2017.
Hardness Escalation in Proof Complexity via Composition. Talk given at China Theory Week 2017, Shanghai, July 2017.
How Limited Interaction Hinders Real Communication (and What it Means for Proof and Circuit Complexity). Talk given at the Tata Institute of Fundamental Research, Mumbai, February 2017.
Cumulative Space in Black-White Pebbling and Resolution. Talk given at ITCS 2017, Berkeley, January 2017. Video.
How Limited Interaction Hinders Real Communication (and What it Means for Proof and Circuit Complexity). Talk given at the Theoretical Foundations of SAT Solving Workshop, Toronto, August 2016.
How Limited Interaction Hinders Real Communication (and What it Means for Proof and Circuit Complexity). Talk given at the University of Toronto, August 2016.
How Limited Interaction Hinders Real Communication (and What it Means for Proof and Circuit Complexity). Talk given at the Proof complexity workshop at the Special Semester Program on Computational Complexity, St Petersburg, May 2016.
The Size of Coefficients in Cutting Planes Proofs. Talk given at the Special Semester Program on Computational Complexity, St Petersburg, May 2016.
Hardness of Approximation in PSPACE and Separation Results for Pebble Games. Talk given at FOCS 2015, Berkeley, October 2015. Video.
Size-Space Bounds and Trade-offs for CDCL Proofs. Talk given at the Proof complexity workshop at the Summer of Logic, Vienna, July 2014.