On the Complexity of Finding Narrow Proofs. - Christoph Berkholz (FOCS, 2012)

Bounds for the quantifier depth in two-variable logic - Christoph Berkholz; Oleg Verbitsky 001 (CoRR, 2012)

Lower Bounds for Existential Pebble Games and k-Consistency Tests - Christoph Berkholz (Log. Methods Comput. Sci., 2013)

The Propagation Depth of Local Consistency. - Christoph Berkholz (CP, 2014)

Parameterized Complexity of Fixed Variable Logics. - Christoph Berkholz; Michael Elberfeld (FSTTCS, 2014)

Untere Schranken für heuristische Algorithmen. - Christoph Berkholz (Ausgezeichnete Informatikdissertationen, 2014)

Lower Bounds for Heuristic Algorithms. - Christoph Berkholz (2014)

Limitations of Algebraic Approaches to Graph Isomorphism Testing. - Christoph Berkholz; Martin Grohe (ICALP (1), 2015)

Bounds for the Quantifier Depth in Finite-Variable Logics: Alternation Hierarchy. - Christoph Berkholz; Andreas Krebs; Oleg Verbitsky 001 (ACM Trans. Comput. Log., 2015)

Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps. - Christoph Berkholz; Jakob Nordström (Electron. Colloquium Comput. Complex., 2016)

Answering Conjunctive Queries under Updates. - Christoph Berkholz; Jens Keppeler; Nicole Schweikardt (PODS, 2017)

Linear Diophantine Equations, Group CSPs, and Graph Isomorphism. - Christoph Berkholz; Martin Grohe (SODA, 2017)

The Relation between Polynomial Calculus, Sherali-Adams, and Sum-of-Squares Proofs. - Christoph Berkholz (Electron. Colloquium Comput. Complex., 2017)

Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement. - Christoph Berkholz; Paul S. Bonsma; Martin Grohe (Theory Comput. Syst., 2017)

Answering UCQs under Updates and in the Presence of Integrity Constraints. - Christoph Berkholz; Jens Keppeler; Nicole Schweikardt (ICDT, 2018)

On the speed of constraint propagation and the time complexity of arc consistency testing. - Christoph Berkholz; Oleg Verbitsky 001 (J. Comput. Syst. Sci., 2018)

Answering FO+MOD Queries under Updates on Bounded Degree Databases. - Christoph Berkholz; Jens Keppeler; Nicole Schweikardt (ACM Trans. Database Syst., 2018)

Constant Delay Enumeration with FPT-Preprocessing for Conjunctive Queries of Bounded Submodular Width. - Christoph Berkholz; Nicole Schweikardt (MFCS, 2019)

Compiling Existential Positive Queries to Bounded-Variable Fragments. - Christoph Berkholz; Hubie Chen (PODS, 2019)

Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration. - Nofar Carmeli; Shai Zeevi; Christoph Berkholz; Benny Kimelfeld; Nicole Schweikardt (PODS, 2020)

Supercritical Space-Width Trade-offs for Resolution. - Christoph Berkholz; Jakob Nordström (SIAM J. Comput., 2020)

Constant delay enumeration for conjunctive queries: a tutorial. - Christoph Berkholz; Fabian Gerhardt; Nicole Schweikardt (ACM SIGLOG News, 2020)

Probabilistic Databases under Updates: Boolean Query Evaluation and Ranked Enumeration. - Christoph Berkholz; Maximilian Merz (PODS, 2021)

Finite and Algorithmic Model Theory (Dagstuhl Seminar 22051). - Albert Atserias; Christoph Berkholz; Kousha Etessami; Joanna Ochremiak (Dagstuhl Reports, 2022)

Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration. - Nofar Carmeli; Shai Zeevi; Christoph Berkholz; Alessio Conte; Benny Kimelfeld; Nicole Schweikardt (ACM Trans. Database Syst., 2022)

A Dichotomy for Succinct Representations of Homomorphisms. - Christoph Berkholz; Harry Vinall-Smeeth (ICALP, 2023)

Modal Logic Is More Succinct Iff Bi-Implication Is Available in Some Form. - Christoph Berkholz; Dietrich Kuske; Christian Schwarz (STACS, 2024)

A Characterization of Efficiently Compilable Constraint Languages. - Christoph Berkholz; Stefan Mengel; Hermann Wilhelm (STACS, 2024)

Supercritical Size-Width Tree-Like Resolution Trade-Offs for Graph Isomorphism. - Christoph Berkholz; Moritz Lichter; Harry Vinall-Smeeth (MFCS, 2025)

Boolean basis, formula size, and number of modal operators. - Christoph Berkholz; Dietrich Kuske; Christian Schwarz (Log. Methods Comput. Sci., 2025)

Factorised Representations of Join Queries: Tight Bounds and a New Dichotomy. - Christoph Berkholz; Harry Vinall-Smeeth (CoRR, 2025)