Algorithms & Theoretical Computer Science

EPFL has a rich and diverse group in Algorithms and Theoretical Computer Science. Our research targets a better mathematical understanding of the foundations of computing to help not only to optimize algorithms, communication protocols and systems for efficiency but also to determine their fundamental limitations. Research areas include algorithmic graph theory, combinatorial optimization, complexity theory, computational algebra, distributed algorithms and network flow algorithms.

Affiliated People
Alexandre Alahi
Alexandre Alahi

Tenure Track Assistant Professor

[email protected] GC C1 383
Nicolas Boumal
Nicolas Boumal

Tenure Track Assistant Professor

[email protected] MA C2 627
Nicolas Flammarion
Nicolas Flammarion

Tenure Track Assistant Professor

[email protected] INJ 336
Mika Göös
Mika Göös

Tenure Track Assistant Professor

[email protected] INJ 135
Martin Jaggi
Martin Jaggi

Tenure Track Assistant Professor

[email protected] INJ 341
Michael Kapralov
Michael Kapralov

Tenure Track Assistant Professor

[email protected] INJ 113