Ola Nils Anders Svensson

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

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

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

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

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

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

vCard
Administrative data

Teaching & PhD

Teaching

Computer Science

Communication Systems

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.

Algorithmic Toolbox

(Coursebook not yet approved by the section)