# Navigation Area

# Theory and Algorithms

# Main content

Computer science has the dual nature of being an engineering science as well as a basic science (like physics), concerned with fundamental concepts including processes, computation, information, and communication. Computer science theory is concerned with understanding, defining and analyzing these concepts. Theoretical insights are for practice often highly relevant (for instance from algorithm theory) or even intrinsically necessary (for instance from cryptography). Focal areas of theory research at ETH computer science include cryptography and complexity, as well as algorithms, discrete mathematics, and optimization, in part jointly with the mathematics department.

## Areas of research

algorithms, bioinformatics, combinatorics, complexity theory, computational science, cryptography, geometry, optimization, randomization & probabilistic methods

**Peter Arbenz**

Titular Professor

Website

More details

computational science, high-performance computing, numerical algorithms, parallel computing

**Komei Fukuda**

Titular Professor (joint with Mathematics)

Website

More details

combinatorics, geometry, optimization, polyhedral computation

**Bernd Gärtner**

Titular Professor

Website

More details

algorithms, combinatorics, geometry, optimization

distributed algorithms, network algorithms, randomized algorithms, theory of computation, graph theory, probabilistic methods

**Juraj Hromkovic**

Professor

Website

More details

complexity theory, lower bounds, automata theory, algorithmics for hard problems, discrete optimization, online algorithms, information content

**Ueli Maurer**

Professor

Website

More details

cryptography, information security, theoretical computer science, information theory, discrete mathematics

**Angelika Steger**

Professor

Website

More details

algorithms, combinatorics, randomization and probabilistic methods, combinatorial models for optimization

**Emo Welzl**

Professor

Website

More details

algorithms, combinatorics, discrete and computational geometry, satisfiability, randomization and probabilistic methods, combinatorial models for optimization

**Peter Widmayer**

Professor

Website

More details

algorithms, optimization, applications