Stefan Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin, “Proof Complexity and the Binary Encoding of Combinatorial Principles”, SIAM J. Comput., 53:3 (2024), 764
Susanna F. De Rezende, Aaron Potechin, Kilian Risse, 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2023, 12
Sarah Sigley, Olaf Beyersdorff, “Proof Complexity of Modal Resolution”, J Autom Reasoning, 66:1 (2022), 1
Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander A. Razborov, “Clique is hard on average for regular resolution”, Journal of the ACM, 68:4 (2021), 23–26
Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander Razborov, Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018, 866
Massimo Lauria, “Cliques enumeration and tree-like resolution proofs”, Information Processing Letters, 135 (2018), 62
Massimo Lauria, Pavel Pudlák, Vojtěch Rödl, Neil Thapen, “The complexity of proving that a graph is Ramsey”, Combinatorica, 37:2 (2017), 253
Massimo Lauria, Jan Elffers, Jakob Nordström, Marc Vinyals, Lecture Notes in Computer Science, 10491, Theory and Applications of Satisfiability Testing – SAT 2017, 2017, 464
Albert Atserias, Massimo Lauria, Jakob Nordström, “Narrow Proofs May Be Maximally Long”, ACM Trans. Comput. Logic, 17:3 (2016), 1
Alexander Razborov, “Guest Column”, SIGACT News, 47:2 (2016), 66