Ola Nils Anders Svensson

EPFL IC IINFCOM THL2
INJ 112 (Bâtiment INJ)
Station 14
1015 Lausanne

Expertise

Algorithms Hardness of Approximation Scheduling

Awards

Michael and Sheila Held Prize

2019

Teaching & PhD

PhD Students

Miltiadis Stouras, Marina Drygala, Davide Mazzali, Lukas Vogl, Radu Vintan, Weiqiang Yuan

Past EPFL PhD Students

Abbas Bazzi, Christos Kalaitzis, Ashkan Norouzi Fard, Jakub Tarnawski, Buddhima Gamlath, Paritosh Garg, Xinrui Jia, Etienne Bamas

Past EPFL PhD Students as codirector

Andreas Maggiori

Courses

Algorithms I

CS-250

The students learn the theory and practice of basic concepts and techniques in algorithms. The course covers mathematical induction, techniques for analyzing algorithms, elementary data structures, major algorithmic paradigms such as dynamic programming, sorting and searching, and graph algorithms.

Topics in theoretical computer science

CS-455

The students gain an in-depth knowledge of several current and emerging areas of theoretical computer science. The course familiarizes them with advanced techniques, and develops an understanding of fundamental questions that underlie some of the key problems of modern computer science.