Benedikt Pago

According to our database, Benedikt Pago authored at least 8 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Limitations of Game Comonads for Invertible-Map Equivalence via Homomorphism Indistinguishability.

Moritz Lichter, Benedikt Pago, Tim Seppelt

Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

2023

Limitations of choiceless computation.

Benedikt Pago

PhD thesis, 2023

Limitations of Game Comonads via Homomorphism Indistinguishability.

Moritz Lichter, Benedikt Pago, Tim Seppelt

CoRR, 2023

Lower Bounds for Choiceless Polynomial Time via Symmetric XOR-Circuits.

Benedikt Pago

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus.

Benedikt Pago

Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

2021

Choiceless Computation and Symmetry: Limitations of Definability.

Benedikt Pago

Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

2019

A Finite-Model-Theoretic View on Propositional Proof Complexity.

Erich Grädel, Martin Grohe, Benedikt Pago, Wied Pakusa

Log. Methods Comput. Sci., 2019

2017

The Model-Theoretic Expressiveness of Propositional Proof Systems.

Erich Grädel, Benedikt Pago, Wied Pakusa

Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017