- Jan Krajiček, 1295, Mathematical Foundations of Computer Science 1997, 1997, 85
- Susanna F. De Rezende, Or Meir, Jakob Nordström, Robert Robere, “Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling”, comput. complex., 30, no. 1, 2021, 4
- M.L. Bonet, N. Galesi, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039), 1999, 422
- Ilario Bonacina, Nicola Galesi, Proceedings of the 4th conference on Innovations in Theoretical Computer Science, 2013, 455
- Russell Impagliazzo, Sasank Mouli, Toniann Pitassi, Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020, 591
- Ilario Bonacina, Nicola Galesi, “A Framework for Space Complexity in Algebraic Proof Systems”, J. ACM, 62, no. 3, 2015, 1
- Josh Buresh-Oppenheim, Toniann Pitassi, Matt Clegg, Russell Impagliazzo, 1853, Automata, Languages and Programming, 2000, 926
- Pavel Pudlák, Neil Thapen, “Random resolution refutations”, comput. complex., 28, no. 2, 2019, 185
- Pavel Pudlák, 137, Handbook of Proof Theory, 1998, 547
- Michal Garlík, Leszek Aleksander Kołodziejczyk, “Some Subsystems of Constant-Depth Frege with Parity”, ACM Trans. Comput. Logic, 19, no. 4, 2018, 1