Christoph Berkholz

ORCID

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 36

Top Venues

CoRR

PODS

Electron. Colloquium Comput. Complex.

STACS

RWTH Aachen University, Germany (PHD)

Education History

RWTH Aachen University, Germany

PHD

Publications

Christoph Berkholz, Dietrich Kuske, Christian Schwarz
Modal Logic Is More Succinct Iff Bi-Implication Is Available in Some Form. STACS (2024)
Christoph Berkholz, Moritz Lichter, Harry Vinall-Smeeth
Supercritical Size-Width Tree-Like Resolution Trade-Offs for Graph Isomorphism. CoRR (2024)
Christoph Berkholz, Stefan Mengel, Hermann Wilhelm
A Characterization of Efficiently Compilable Constraint Languages. STACS (2024)
Christoph Berkholz, Harry Vinall-Smeeth
A Dichotomy for Succinct Representations of Homomorphisms. ICALP (2023)
Christoph Berkholz, Jakob Nordström
Near-optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps. J. ACM 70 (5) (2023)
Christoph Berkholz, Stefan Mengel, Hermann Wilhelm
A characterization of efficiently compilable constraint languages. CoRR (2023)
Christoph Berkholz, Harry Vinall-Smeeth
A dichotomy for succinct representations of homomorphisms. CoRR (2022)
Albert Atserias, Christoph Berkholz, Kousha Etessami, Joanna Ochremiak
Finite and Algorithmic Model Theory (Dagstuhl Seminar 22051). Dagstuhl Reports 12 (1) (2022)
Nofar Carmeli, Shai Zeevi, Christoph Berkholz, Alessio Conte, Benny Kimelfeld, Nicole Schweikardt
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration. ACM Trans. Database Syst. 47 (3) (2022)
Christoph Berkholz, Maximilian Merz
Probabilistic Databases under Updates: Boolean Query Evaluation and Ranked Enumeration. PODS (2021)
Christoph Berkholz, Fabian Gerhardt, Nicole Schweikardt
Constant delay enumeration for conjunctive queries: a tutorial. ACM SIGLOG News 7 (1) (2020)
Christoph Berkholz, Nicole Schweikardt
Constant delay enumeration with FPT-preprocessing for conjunctive queries of bounded submodular width. CoRR (2020)
Nofar Carmeli, Shai Zeevi, Christoph Berkholz, Benny Kimelfeld, Nicole Schweikardt
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration. PODS (2020)
Christoph Berkholz, Jakob Nordström
Supercritical Space-Width Trade-offs for Resolution. SIAM J. Comput. 49 (1) (2020)
Nofar Carmeli, Shai Zeevi, Christoph Berkholz, Benny Kimelfeld, Nicole Schweikardt
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration. CoRR (2019)
Christoph Berkholz, Hubie Chen
Compiling Existential Positive Queries to Bounded-Variable Fragments. PODS (2019)
Christoph Berkholz, Nicole Schweikardt
Constant Delay Enumeration with FPT-Preprocessing for Conjunctive Queries of Bounded Submodular Width. MFCS (2019)
Christoph Berkholz, Oleg Verbitsky
On the speed of constraint propagation and the time complexity of arc consistency testing. J. Comput. Syst. Sci. 91 (2018)
Christoph Berkholz
The Relation between Polynomial Calculus, Sherali-Adams, and Sum-of-Squares Proofs. STACS (2018)
Christoph Berkholz, Jens Keppeler, Nicole Schweikardt
Answering UCQs under Updates and in the Presence of Integrity Constraints. ICDT (2018)
Christoph Berkholz, Jens Keppeler, Nicole Schweikardt
Answering FO+MOD Queries under Updates on Bounded Degree Databases. ACM Trans. Database Syst. 43 (2) (2018)
Christoph Berkholz, Paul S. Bonsma, Martin Grohe
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement. Theory Comput. Syst. 60 (4) (2017)
Christoph Berkholz, Jens Keppeler, Nicole Schweikardt
Answering Conjunctive Queries under Updates. CoRR (2017)
Christoph Berkholz, Jens Keppeler, Nicole Schweikardt
Answering UCQs under updates and in the presence of integrity constraints. CoRR (2017)
Christoph Berkholz, Jens Keppeler, Nicole Schweikardt
Answering Conjunctive Queries under Updates. PODS (2017)
Christoph Berkholz
The Relation between Polynomial Calculus, Sherali-Adams, and Sum-of-Squares Proofs. Electron. Colloquium Comput. Complex. 24 (2017)
Christoph Berkholz, Jens Keppeler, Nicole Schweikardt
Answering FO+MOD Queries Under Updates on Bounded Degree Databases. ICDT (2017)
Christoph Berkholz, Martin Grohe
Linear Diophantine Equations, Group CSPs, and Graph Isomorphism. SODA (2017)
Christoph Berkholz, Jens Keppeler, Nicole Schweikardt
Answering FO+MOD queries under updates on bounded degree databases. CoRR (2017)
Christoph Berkholz, Jakob Nordström
Supercritical Space-Width Trade-offs for Resolution. Electron. Colloquium Comput. Complex. 23 (2016)
Christoph Berkholz, Jakob Nordström
Supercritical Space-Width Trade-Offs for Resolution. ICALP (2016)
Christoph Berkholz, Jakob Nordström
Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps. LICS (2016)
Christoph Berkholz, Jakob Nordström
Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps. CoRR (2016)
Christoph Berkholz, Jakob Nordström
Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps. Electron. Colloquium Comput. Complex. 23 (2016)
Christoph Berkholz, Jakob Nordström
Supercritical Space-Width Trade-offs for Resolution. CoRR (2016)
Christoph Berkholz, Martin Grohe
Linear Diophantine Equations, Group CSPs, and Graph Isomorphism. CoRR (2016)
Christoph Berkholz, Martin Grohe
Limitations of Algebraic Approaches to Graph Isomorphism Testing. ICALP (1) (2015)
Christoph Berkholz, Paul S. Bonsma, Martin Grohe
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement. CoRR (2015)
Christoph Berkholz, Martin Grohe
Limitations of Algebraic Approaches to Graph Isomorphism Testing. CoRR (2015)
Christoph Berkholz, Andreas Krebs, Oleg Verbitsky
Bounds for the Quantifier Depth in Finite-Variable Logics: Alternation Hierarchy. ACM Trans. Comput. Log. 16 (3) (2015)
Christoph Berkholz, Michael Elberfeld
Parameterized Complexity of Fixed Variable Logics. FSTTCS (2014)
Christoph Berkholz
The Propagation Depth of Local Consistency. CoRR (2014)
Christoph Berkholz
The Propagation Depth of Local Consistency. CP (2014)
Christoph Berkholz
Untere Schranken für heuristische Algorithmen. Ausgezeichnete Informatikdissertationen (2014)
Christoph Berkholz, Oleg Verbitsky
On the speed of constraint propagation and the time complexity of arc consistency testing CoRR (2013)
Christoph Berkholz
Lower Bounds for Existential Pebble Games and k-Consistency Tests Log. Methods Comput. Sci. 9 (4) (2013)
Christoph Berkholz, Paul S. Bonsma, Martin Grohe
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement. ESA (2013)
Christoph Berkholz, Oleg Verbitsky
On the Speed of Constraint Propagation and the Time Complexity of Arc Consistency Testing. MFCS (2013)
Christoph Berkholz, Andreas Krebs, Oleg Verbitsky
Bounds for the quantifier depth in finite-variable logics: Alternation hierarchy. CSL (2013)
Christoph Berkholz
On the complexity of finding narrow proofs CoRR (2012)
Christoph Berkholz
Lower Bounds for Existential Pebble Games and k-Consistency Tests. LICS (2012)
Christoph Berkholz
On the Complexity of Finding Narrow Proofs. FOCS (2012)
Christoph Berkholz, Oleg Verbitsky
Bounds for the quantifier depth in two-variable logic CoRR (2012)

Christoph Berkholz.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Christoph Berkholz