معرفی
Prof. Christoph Berkholz is a University Professor and head of the Algorithms Group at the Institute for Theoretical Computer Science within the Department of Computer Science and Automation at Humboldt-Universität zu Berlin since August 2022. He holds a PhD from RWTH Aachen University (2014) and completed postdoctoral research in Stockholm, Berlin, and Berkeley. Prior to his current role, he served as a Junior Professor of Logic and Complexity at Humboldt-Universität, leading the DFG-funded Emmy Noether Junior Research Group on Representation Complexity of Enumeration and Counting Algorithms.
His research focuses on theoretical computer science, particularly algorithmic methods and their fundamental limits. Core questions driving his work include conditions for efficient algorithms, structural differences between 'light' and 'heavy' input instances, and the capabilities/limitations of algorithmic strategies. Research applications span query optimization in databases, SAT solving, and constraint solving. He has published ~30 papers and actively participates in program committees for AI, theoretical computer science, and database systems conferences.
Prof. Berkholz's group investigates methods ranging from classical decision problems (e.g., propositional logic satisfiability) to dynamic algorithms supporting efficient updates. Key application areas include probabilistic databases and SAT/constraint-solving data structures. No specific awards are listed, though his Emmy Noether Research Group indicates significant grant recognition.
