Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer, “Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements”, J. ACM, 2025
Mika Göös, Gilbert Maystre, Kilian Risse, Dmitry Sokolov, Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025, 1359
Susanna F. de Rezende, Noah Fleming, Duri Andrea Janett, Jakob Nordström, Shuo Pang, Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025, 1371
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
Martin Grohe, Moritz Lichter, Daniel Neuen, Pascal Schweitzer, 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 2023, 798
Christoph Berkholz, Jakob Nordström, “Near-optimal Lower Bounds on Quantifier Depth and Weisfeiler–Leman Refinement Steps”, J. ACM, 70:5 (2023), 1
Christoph Berkholz, Jakob Nordström, “Supercritical Space-Width Trade-offs for Resolution”, SIAM J. Comput., 49:1 (2020), 98
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
Ankit Garg, Mika Göös, Pritish Kamath, Dmitry Sokolov, Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018, 902