Univ.-Prof. Dr. Christoph Berkholz
christoph.berkholz (at) tu-ilmenau.de
+49 3677 69-2783
Visiting address Zusebau, room 1045(Helmholtzplatz 5, 98693 Ilmenau)
Postal address TU Ilmenau, P.O. Box 10 05 65, 98684 Ilmenau
I am head of the Algorithmics group at the Institute of Theoretical Computer Science of the Faculty of Computer Science and Automation since August 2022. Previously, I was a junior professor at the Institute of Computer Science at the Humboldt University of Berlin and head of the DFG-funded Emmy Noether junior research group Representation Complexity of Enumeration and Counting Algorithms. My research interests are in Theoretical Computer Science, in particular the development and analysis of algorithmic methods and their principal limits. My research touches (and links) the following topics.
- Logic and database theory
- Proof complexity and foundations of SAT solving
- knowledge compilation
- Constraint Satisfaction
- Dynamic algorithms; counting and enumeration algorithms
- Co-organization of the Dagstuhl Seminar Finite and Algorithmic Model Theory (30.01. - 04.02.2022) Report
Participation in program committees
- 43rd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS 2024)
- 20th Symposium on Database Systems for Business, Technology and Web (BTW 2023)
- 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)
- 31st International Joint Conference on Artificial Intelligence and the 25th European Conference on Artificial Intelligence (IJCAI-ECAI 2022)
- 30th International Joint Conference on Artificial Intelligence (IJCAI-21)
- 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2021)
- 29th International Joint Conference on Artificial Intelligence and 17th Pacific Rim International Conference on Artificial Intelligence (IJCAI-PRICAI2020)
- 23rd International Conference on Database Theory (ICDT 2020)
- 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)
Overview of regular and current courses at the Institute for Theoretical Computer Science.
Winter term 2022/23
- Algorithms and Data Structures 2 (Bachelor)
- Efficient Algorithms (Master)
- Proof Complexity (Master)
Publications and Preprints
For a current list of publications, see dblp.
- My Erdős number is 3 (via Oleg Verbitsky).
- My Bacon number is ≤4 (via Detlev Buck, for example).
- Thus, my Erdős-Bacon number is ≤7.
- Mathematics Genealogy Project entry