| 2026 | ICDT | Factorised Representations of Join Queries: Tight Bounds and a New Dichotomy. | Christoph Berkholz, Harry Vinall-Smeeth |
| 2026 | SAT | Proof Systems Based on Structured Circuits. | Christoph Berkholz, Matthus Micun |
| 2025 | MFCS | Supercritical Size-Width Tree-Like Resolution Trade-Offs for Graph Isomorphism. | Christoph Berkholz, Moritz Lichter, Harry Vinall-Smeeth |
| 2024 | STACS | Modal Logic Is More Succinct Iff Bi-Implication Is Available in Some Form. | Christoph Berkholz, Dietrich Kuske, Christian Schwarz |
| 2024 | STACS | A Characterization of Efficiently Compilable Constraint Languages. | Christoph Berkholz, Stefan Mengel, Hermann Wilhelm |
| 2023 | ICALP | A Dichotomy for Succinct Representations of Homomorphisms. | Christoph Berkholz, Harry Vinall-Smeeth |
| 2021 | PODS | Probabilistic Databases under Updates: Boolean Query Evaluation and Ranked Enumeration. | Christoph Berkholz, Maximilian Merz |
| 2020 | PODS | Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration. | Nofar Carmeli, Shai Zeevi, Christoph Berkholz, Benny Kimelfeld, Nicole Schweikardt |
| 2019 | MFCS | Constant Delay Enumeration with FPT-Preprocessing for Conjunctive Queries of Bounded Submodular Width. | Christoph Berkholz, Nicole Schweikardt |
| 2019 | PODS | Compiling Existential Positive Queries to Bounded-Variable Fragments. | Christoph Berkholz, Hubie Chen |
| 2018 | ICDT | Answering UCQs under Updates and in the Presence of Integrity Constraints. | Christoph Berkholz, Jens Keppeler, Nicole Schweikardt |
| 2018 | STACS | The Relation between Polynomial Calculus, Sherali-Adams, and Sum-of-Squares Proofs. | Christoph Berkholz |
| 2017 | ICDT | Answering FO+MOD Queries Under Updates on Bounded Degree Databases. | Christoph Berkholz, Jens Keppeler, Nicole Schweikardt |
| 2017 | PODS | Answering Conjunctive Queries under Updates. | Christoph Berkholz, Jens Keppeler, Nicole Schweikardt |
| 2017 | SODA | Linear Diophantine Equations, Group CSPs, and Graph Isomorphism. | Christoph Berkholz, Martin Grohe |
| 2016 | ICALP | Supercritical Space-Width Trade-Offs for Resolution. | Christoph Berkholz, Jakob Nordstrm |
| 2016 | LICS | Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps. | Christoph Berkholz, Jakob Nordstrm |
| 2015 | ICALP | Limitations of Algebraic Approaches to Graph Isomorphism Testing. | Christoph Berkholz, Martin Grohe |
| 2014 | CP | The Propagation Depth of Local Consistency. | Christoph Berkholz |
| 2013 | CSL | Bounds for the quantifier depth in finite-variable logics: Alternation hierarchy. | Christoph Berkholz, Andreas Krebs, Oleg Verbitsky |
| 2013 | ESA | Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement. | Christoph Berkholz, Paul S. Bonsma, Martin Grohe |
| 2013 | MFCS | On the Speed of Constraint Propagation and the Time Complexity of Arc Consistency Testing. | Christoph Berkholz, Oleg Verbitsky |
| 2012 | FOCS | On the Complexity of Finding Narrow Proofs. | Christoph Berkholz |
| 2012 | LICS | Lower Bounds for Existential Pebble Games and k-Consistency Tests. | Christoph Berkholz |