default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenedikt Pago
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2023
[b1]Benedikt Pago:
Limitations of choiceless computation. RWTH Aachen University, Germany, 2023
Journal Articles
- 2024
- [j2]Anuj Dawar, Benedikt Pago:
A Logic for P: Are we Nearly There Yet? ACM SIGLOG News 11(2): 35-60 (2024) - 2019
- [j1]Erich Grädel, Martin Grohe, Benedikt Pago
, Wied Pakusa:
A Finite-Model-Theoretic View on Propositional Proof Complexity. Log. Methods Comput. Sci. 15(1) (2019)
Conference and Workshop Papers
- 2024
- [c5]Moritz Lichter, Benedikt Pago, Tim Seppelt:
Limitations of Game Comonads for Invertible-Map Equivalence via Homomorphism Indistinguishability. CSL 2024: 36:1-36:19 - 2023
- [c4]Benedikt Pago:
Finite Model Theory and Proof Complexity Revisited: Distinguishing Graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus. CSL 2023: 31:1-31:19 - [c3]Benedikt Pago:
Lower Bounds for Choiceless Polynomial Time via Symmetric XOR-Circuits. MFCS 2023: 73:1-73:15 - 2021
- [c2]Benedikt Pago:
Choiceless Computation and Symmetry: Limitations of Definability. CSL 2021: 33:1-33:21 - 2017
- [c1]Erich Grädel, Benedikt Pago, Wied Pakusa:
The Model-Theoretic Expressiveness of Propositional Proof Systems. CSL 2017: 27:1-27:18
Informal and Other Publications
- 2024
- [i6]Benedikt Pago:
Choiceless Computation and Symmetry: Limitations of Definability. CoRR abs/2401.07147 (2024) - [i5]Moritz Lichter, Benedikt Pago:
Limitations of Affine Integer Relaxations for Solving Constraint Satisfaction Problems. CoRR abs/2407.09097 (2024) - 2023
- [i4]Benedikt Pago:
Lower bounds for Choiceless Polynomial Time via Symmetric XOR-circuits. CoRR abs/2302.05426 (2023) - [i3]Moritz Lichter, Benedikt Pago, Tim Seppelt:
Limitations of Game Comonads via Homomorphism Indistinguishability. CoRR abs/2308.05693 (2023) - 2022
- [i2]Benedikt Pago:
Finite Model Theory and Proof Complexity revisited: Distinguishing graphs in Choiceless Polynomial Time and the Extended Polynomial Calculus. CoRR abs/2206.05086 (2022) - 2018
- [i1]Erich Grädel, Martin Grohe, Benedikt Pago, Wied Pakusa:
A Finite-Model-Theoretic View on Propositional Proof Complexity. CoRR abs/1802.09377 (2018)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
