- R. Impagliazzo, N. Segerlind, Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 2001, 200
- Albert Atserias, Massimo Lauria, Jakob Nordström, “Narrow Proofs May Be Maximally Long”, ACM Trans. Comput. Logic, 17, no. 3, 2016, 1
- D. Grigoriev, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), 1998, 648
- Dima Grigoriev, Edward A. Hirsch, “Algebraic proof systems over formulas”, Theoretical Computer Science, 303, no. 1, 2003, 83
- Chris Beck, Jakob Nordstrom, Bangsheng Tang, Proceedings of the forty-fifth annual ACM symposium on Theory of Computing, 2013, 813
- Susanna F. de Rezende, Mika Göös, Jakob Nordström, Toniann Pitassi, Robert Robere, Dmitry Sokolov, Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021, 209
- Alexander A Razborov, “Resolution lower bounds for perfect matching principles”, Journal of Computer and System Sciences, 69, no. 1, 2004, 3
- Jakob Nordström, “On the interplay between proof complexity and SAT solving”, ACM SIGLOG News, 2, no. 3, 2015, 19
- Iddo Tzameret, “Algebraic proofs over noncommutative formulas”, Information and Computation, 209, no. 10, 2011, 1269
- Olaf Beyersdorff, Oliver Kutz, 7388, Lectures on Logic and Computation, 2012, 1