Ola Nils Anders Svensson

photo placeholder image

Associate Professor

ola.svensson@epfl.ch +41 21 693 12 04 http://theory.epfl.ch/osven/

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

+41 21 693 12 04
+41 21 693 26 41
Office:  INJ 112
EPFL > IC > IINFCOM > THL2

Web site:  Web site:  https://theory.epfl.ch

+41 21 693 12 04
EPFL > IC > IC-SIN > SIN-ENS

Web site:  Web site:  https://sin.epfl.ch

+41 21 693 12 04
EPFL > IC > IC-SSC > SSC-ENS

Web site:  Web site:  https://ssc.epfl.ch

EPFL CIB
GA 3 34 (Bâtiment GA)
Station 5
1015 Lausanne

+41 21 693 12 04
Office:  GA 3 34
EPFL > VPA-AVP-CP > CIB > CIB-GE

Web site:  Web site:  https://bernoulli.epfl.ch

+41 21 693 12 04
EPFL > VPA-AVP-DLE > AVP-DLE-EDOC > EDIC-ENS

vCard
Administrative data

Teaching & PhD

Teaching

Computer Science

Communication Systems

PhD Students

Drygala Marina Rebekah Rosie, Mazzali Davide, Stouras Miltiadis, Vintan Radu, Vogl Lukas Fritz Felix, Yuan Weiqiang,

Past EPFL PhD Students

Bamas Etienne Michel François , Bazzi Abbas , Gamlath Ralalage Buddhima Ruwanmini Gamlath , Garg Paritosh , Jia Xinrui , Kalaitzis Christos , Maggiori Andreas , Norouzi Fard Ashkan , Tarnawski Jakub ,

Courses

Algorithms I

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

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.