Publications

Benedikt Pago

2024

  • M. Lichter, B. Pago, and T. Seppelt. Limitations of Game Comonads for Invertible-Map Equivalence via Homomorphism Indistinguishability. In 32nd EACSL Annual Conference on Computer Science Logic (CSL 2024) (A. Murano and A. Silva, Eds.), vol. 288 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 36:1–36:19, Dagstuhl, Germany. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024.             

2023

  • M. Lichter, B. Pago, and T. Seppelt. Limitations of Game Comonads via Homomorphism Indistinguishability. arXiv:2308.05693 [cs.LO], full version of CSL'24 paper, 2023.             
  • B. Pago. Limitations of Choiceless Computation. PhD thesis, RWTH Aachen University, 2023.             
  • B. Pago. Lower bounds for Choiceless Polynomial Time via Symmetric XOR-circuits. arXiv:2302.05426 [cs.CC], full version of MFCS'23 paper, 2023.             
  • B. Pago. Lower Bounds for Choiceless Polynomial Time via Symmetric XOR-Circuits. In 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023) (J. Leroux, S. Lombardy, and D. Peleg, Eds.), vol. 272 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 73:1–73:15, Dagstuhl, Germany. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023.             
  • B. Pago. Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus. In 31st EACSL Annual Conference on Computer Science Logic (CSL 2023) (B. Klin and E. Pimentel, Eds.), vol. 252 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 31:1–31:19, Dagstuhl, Germany. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023.             

2022

2021

  • B. Pago. Choiceless Computation and Symmetry: Limitations of Definability. In 29th EACSL Annual Conference on Computer Science Logic (CSL 2021) (C. Baier and J. Goubault-Larrecq, Eds.), vol. 183 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 33:1–33:21, Dagstuhl, Germany. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2021.             

2019

  • E. Grädel, M. Grohe, B. Pago, and W. Pakusa. A Finite-Model-Theoretic View on Propositional Proof Complexity. Logical Methods in Computer Science, vol. Volume 15, Issue 1, 2019.             

2017

  • E. Grädel, B. Pago, and W. Pakusa. The Model-Theoretic Expressiveness of Propositional Proof Systems. In 26th EACSL Annual Conference on Computer Science Logic (CSL 2017), 2017.