- Ján Pich, “Nisan-Wigderson generators in proof systems with forms of interpolation”, Mathematical Logic Quarterly, 57, no. 4, 2011, 379

- Alexander Razborov, “A New Kind of Tradeoffs in Propositional Proof Complexity”, J. ACM, 63, no. 2, 2016, 1

- James Cook, Omid Etesami, Rachel Miller, Luca Trevisan, 5444, Theory of Cryptography, 2009, 521

- Hanlin Ren, Rahul Santhanam, Zhikun Wang, 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), 2022, 640

- A. Borodin, T. Pitassi, A. Razborov, “Special Issue In Memory of Misha Alekhnovich. Foreword”, comput. complex., 20, no. 4, 2011, 579

- Albert Atserias, Víctor Dalmau, “A combinatorial characterization of resolution width”, Journal of Computer and System Sciences, 74, no. 3, 2008, 323

- Jan Krajíček, Proof Complexity, 2019

- Subhash Khot, Madhur Tulsiani, Pratik Worah, 8572, Automata, Languages, and Programming, 2014, 689

- Michael Alekhnovich, Alexander Razborov, “Satisfiability, Branch-Width and Tseitin tautologies”, comput. complex., 20, no. 4, 2011, 649

- Benny Applebaum, Andrej Bogdanov, Alon Rosen, “A Dichotomy for Local Small-Bias Generators”, J Cryptol, 29, no. 3, 2016, 577
