Mika Göös, Ilan Newman, Artur Riazanov, Dmitry Sokolov, Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024, 2016
Theodoros Papamakarios, Alexander Razborov, “Space characterizations of complexity measures and size-space trade-offs in propositional proof systems”, J. Comput. Syst. Sci., 137 (2023), 20–36
Jacobo Torán, Florian Wörz, “Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space”, comput. complex., 30:1 (2021)
Marc Vinyals, Jan Elffers, Jan Johannsen, Jakob Nordström, Lecture Notes in Computer Science, 12178, Theory and Applications of Satisfiability Testing – SAT 2020, 2020, 182
Nicola Galesi, Navid Talebanfard, Jacobo Torán, “Cops-Robber Games and the Resolution of Tseitin Formulas”, ACM Trans. Comput. Theory, 12:2 (2020), 1
Nicola Galesi, Navid Talebanfard, Jacobo Torán, Lecture Notes in Computer Science, 10929, Theory and Applications of Satisfiability Testing – SAT 2018, 2018, 311