- Dmitry Itsykson, Mikhail Slabodkin, Dmitry Sokolov, 9139, Computer Science – Theory and Applications, 2015, 219
- Dmitry Itsykson, Alexander Knop, 10491, Theory and Applications of Satisfiability Testing – SAT 2017, 2017, 53
- Jakob Nordström, “On the interplay between proof complexity and SAT solving”, ACM SIGLOG News, 2, no. 3, 2015, 19
- Jan Krajíček, Proof Complexity, 2019
- Noah Fleming, Toniann Pitassi, 22, Alasdair Urquhart on Nonclassical and Algebraic Logic and Complexity of Proofs, 2022, 497
- Jakob Nordström, “Narrow Proofs May Be Spacious:Separating Space and Width in Resolution”, SIAM J. Comput., 39, no. 1, 2009, 59
- Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, Alexander A. Razborov, “Parameterized Bounded-Depth Frege Is not Optimal”, ACM Trans. Comput. Theory, 4, no. 3, 2012, 1
- Alexander Razborov, “Pseudorandom generators hard for k-DNF resolution and polynomial calculus resolution”, Ann. Math., 181, no. 2, 2015, 415
- Mladen Mikša, Jakob Nordström, “A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds”, J. ACM, 2024, 3675668