- Søren Riis, 2008 23rd Annual IEEE Symposium on Logic in Computer Science, 2008, 272
- Russell Impagliazzo, Nathan Segerlind, “Constant-depth Frege systems with counting axioms polynomially simulate Nullstellensatz refutations”, ACM Trans. Comput. Logic, 7, no. 2, 2006, 199
- Samuel Buss, Leszek Kołodziejczyk, Konrad Zdanowski, “Collapsing modular counting in bounded arithmetic and constant depth propositional proofs”, Trans. Amer. Math. Soc., 367, no. 11, 2015, 7517
- Nicola Galesi, Leszek Kolodziejczyk, Neil Thapen, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019, 1325
- Nicola Galesi, Massimo Lauria, “Optimality of size-degree tradeoffs for polynomial calculus”, ACM Trans. Comput. Logic, 12, no. 1, 2010, 1
- Noah Fleming, Toniann Pitassi, 22, Alasdair Urquhart on Nonclassical and Algebraic Logic and Complexity of Proofs, 2022, 497
- Jonas Conneryd, Susanna F. De Rezende, Jakob Nordström, Shuo Pang, Kilian Risse, 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2023, 1
- Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson, “Pseudorandom Generators in Propositional Proof Complexity”, SIAM J. Comput., 34, no. 1, 2004, 67
- Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik, 2285, STACS 2002, 2002, 419
- J. Buresh-Oppenheim, T. Morioka, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004., 2004, 54