Benedikt Pago - RankMe

22 papers A* 1A 1B 7Journal 12

Year	Rank	Type	Title / Venue / Authors
2026	B	`conf`	Arity Hierarchies for Quantifiers Closed Under Partial Polymorphisms. CSL Anuj Dawar, Lauri Hella, Benedikt Pago
2026	J	`jnl`	Lower Bounds in Algebraic Complexity via Symmetry and Homomorphism Polynomials. CoRR Prateek Dwivedi, Benedikt Pago, Tim Seppelt
2026	A	`conf`	Symmetric Algebraic Circuits and Homomorphism Polynomials. ITCS Anuj Dawar, Benedikt Pago, Tim Seppelt
2025	J	`jnl`	Arity hierarchies for quantifiers closed under partial polymorphisms. CoRR Anuj Dawar, Lauri Hella, Benedikt Pago
2025	A*	`conf`	Limitations of Affine Integer Relaxations for Solving Constraint Satisfaction Problems. ICALP Moritz Lichter, Benedikt Pago
2025	J	`jnl`	Symmetric Algebraic Circuits and Homomorphism Polynomials. CoRR Anuj Dawar, Benedikt Pago, Tim Seppelt
2025	B	`conf`	Symmetric Proofs in the Ideal Proof System. MFCS Anuj Dawar, Erich Grädel, Leon Kullmann, Benedikt Pago
2025	J	`jnl`	Symmetric Proofs in the Ideal Proof System. CoRR Anuj Dawar, Erich Grädel, Leon Kullmann, Benedikt Pago
2024	J	`jnl`	A Logic for P: Are we Nearly There Yet? ACM SIGLOG News Anuj Dawar, Benedikt Pago
2024	J	`jnl`	Choiceless Computation and Symmetry: Limitations of Definability. CoRR Benedikt Pago
2024	J	`jnl`	Limitations of Affine Integer Relaxations for Solving Constraint Satisfaction Problems. CoRR Moritz Lichter, Benedikt Pago
2024	B	`conf`	Limitations of Game Comonads for Invertible-Map Equivalence via Homomorphism Indistinguishability. CSL Moritz Lichter, Benedikt Pago, Tim Seppelt
2023	B	`conf`	Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus. CSL Benedikt Pago
2023	J	`jnl`	Limitations of Game Comonads via Homomorphism Indistinguishability. CoRR Moritz Lichter, Benedikt Pago, Tim Seppelt
2023	—	`—`	Limitations of choiceless computation. Benedikt Pago
2023	B	`conf`	Lower Bounds for Choiceless Polynomial Time via Symmetric XOR-Circuits. MFCS Benedikt Pago
2023	J	`jnl`	Lower bounds for Choiceless Polynomial Time via Symmetric XOR-circuits. CoRR Benedikt Pago
2022	J	`jnl`	Finite Model Theory and Proof Complexity revisited: Distinguishing graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus. CoRR Benedikt Pago
2021	B	`conf`	Choiceless Computation and Symmetry: Limitations of Definability. CSL Benedikt Pago
2019	J	`jnl`	A Finite-Model-Theoretic View on Propositional Proof Complexity. Log. Methods Comput. Sci. Erich Grädel, Martin Grohe, Benedikt Pago, Wied Pakusa
2018	J	`jnl`	A Finite-Model-Theoretic View on Propositional Proof Complexity. CoRR Erich Grädel, Martin Grohe, Benedikt Pago, Wied Pakusa
2017	B	`conf`	The Model-Theoretic Expressiveness of Propositional Proof Systems. CSL Erich Grädel, Benedikt Pago, Wied Pakusa