- Yuval Filmus, Massimo Lauria, Jakob Nordstrom, Neil Thapen, Noga Ron-Zewi, 2012 IEEE 27th Conference on Computational Complexity, 2012, 334
- Toniann Pitassi, Iddo Tzameret, “Algebraic proof complexity”, ACM SIGLOG News, 3, no. 3, 2016, 21
- Robert Andrews, Michael A. Forbes, Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, 2022, 389
- Azza Gaysin, “ℋ-Colouring Dichotomy in Proof Complexity”, Journal of Logic and Computation, 31, no. 5, 2021, 1206
- Alexander Razborov, “Guest Column”, SIGACT News, 47, no. 2, 2016, 66
- Alexander A. Razborov, 2295, Developments in Language Theory, 2002, 100
- Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik, 2380, Automata, Languages and Programming, 2002, 257
- Alexander Razborov, “Pseudorandom generators hard for k-DNF resolution and polynomial calculus resolution”, Ann. Math., 181, no. 2, 2015, 415
- Pavel Pudlák, 5010, Computer Science – Theory and Applications, 2008, 13
- Toniann Pitassi, Ran Raz, Proceedings of the thirty-third annual ACM symposium on Theory of computing, 2001, 347