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.
Rasmus Kyng
Assistant Professor
external page Website
algorithms, convex optimization, graph algorithms, numerical linear algebra, fine-grained complexity theory, random matrix theory
Ueli Maurer
Full Professor
Website
cryptography, information security, theoretical computer science, information theory, discrete mathematics
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