Theory and Algorithms
Computer science is both an engineering science and a basic science. Thanks to this dual nature, it covers a variety of fundamental concepts including processes, computation, information and communication. Computer science theory is concerned with understanding, defining and analysing these concepts using formally proven guarantees. Theoretical insights are often highly relevant in practice (for instance, from algorithm theory) or even intrinsically necessary – from cryptography, for instance. Focal areas of theory research at the department include cryptography and algorithms and complexity, as well as discrete mathematics, estimation and optimisation. Some of this is conducted jointly with the Department of Mathematics.
Areas of research
algorithms, bioinformatics, combinatorics, complexity theory, computational science, cryptography, geometry, optimization, randomization & probabilistic methods
Karl Bringmann
Full Professor
external page Website
algorithms, fine-grained complexity theory, combinatorial optimization, computational geometry, graph algorithms
Bernd Gärtner
Titular Professor
Website
algorithms, combinatorics, geometry, optimization
Dennis Komm
Associate Professor
Website
algorithm design and analysis, approximation and parametrisation, advice complexity, didactics and education
Rasmus Kyng
Assistant Professor
external page Website
algorithms, convex optimization, graph algorithms, numerical linear algebra, fine-grained complexity theory, random matrix theory
Angelika Steger
Full Professor
Website
algorithms, combinatorics, randomization and probabilistic methods, combinatorial models for optimization
David Steurer
Associate Professor
external page Website
complexity theory, approximation algorithms, convex optimization, parameter estimation, tensor methods
Vera Traub
Associate Professor
external page Website
algorithms, combinatorial optimisation, approximation algorithms