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