Theoretical Computer Science

This website brings together people and activities in and around TCS at EPFL. 


For further information regarding activities, sign up to our emailing lists by sending emails to [email protected] and [email protected]

– Theory seminar:

– Reading group: on Fridays we often meet up for coffee and informal talks at 15:15 in INJ 114

– Reading group on Counting and Sampling:

– Winter school on complexity:


Interested in a PhD position in (theoretical) computer science? See here for instructions on how to apply.

Postdocs positions available. For more information see here.


Emmanuel Abbe (mathematics of data science)
Alessandro Chiesa (complexity, cryptography, security)
Friedrich Eisenbrand (discrete optimization)
Nicolas Flammarion (machine learning, optimization)
Rachid Guerraoui (distributed algorithms)
Mika Göös (complexity)
Martin Jaggi (machine learning, optimization)
Michael Kapralov (algorithm design, sublinear algorithms, sketching, streaming, sparse recovery)
Arjen Lenstra (cryptography)
Janos Pach (combinatorial geometry, geometric graph theory, geometric algorithms, combinatorics)
Amin Shokrollahi (algorithms, coding theory)
Ola Svensson (approximation algorithms, combinatorial optimization)
Rüdiger Urbanke (information theory, coding theory)