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
CH-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

EPFL AVP-PGE EDIC-GE
INN 134 (Bâtiment INN)
Station 14
CH-1015 Lausanne

+41 21 693 12 04
+41 21 693 42 39
Office: INJ 112
EPFL > VPA > VPA-AVP-PGE > AVP-PGE-EDOC > EDIC-GE

Web site: Web site: https://go.epfl.ch/phd-edic

EPFL IC SIN-GE
INN 112 (Bâtiment INN)
Station 14
CH-1015 Lausanne

+41 21 693 12 04
Office: INN 112
EPFL > IC > IC-SIN > SIN-ENS

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

EPFL IC SSC-GE
INR 130 (Bâtiment INR)
Station 14
CH-1015 Lausanne

+41 21 693 12 04
Office: INR 130
EPFL > IC > IC-SSC > SSC-ENS

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

EPFL AVP-PGE CDOCT
CE 1 631 (Centre Est)
Station 1
CH-1015 Lausanne

+41 21 693 12 04
Office: CE 1 631
EPFL > VPA > VPA-AVP-PGE > AVP-PGE-EDOC > CDOCT

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

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

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

vCard
Administrative data

Teaching & PhD

Teaching

Computer Science

Communication Systems

PhD Programs

Doctoral program in computer and communication sciences

PhD Students

Bamas Etienne Michel François, Garg Paritosh, Jia Xinrui, Maggiori Andreas,

Past EPFL PhD Students

Bazzi Abbas , Gamlath Ralalage Buddhima Ruwanmini Gamlath , Kalaitzis Christos , Norouzi Fard Ashkan , Tarnawski Jakub ,

Courses

Algorithms

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.

Advanced algorithms

A first graduate course in algorithms, this course assumes minimal background, but moves rapidly. The objective is to learn the main techniques of algorithm analysis and design, while building a repertory of basic algorithmic solutions to problems in many domains.