The spring semester 2021 will certainly take place online until Easter. Exceptions: Courses that can only be carried out with on-site presence. Please note the information provided by the lecturers.

Angelika Steger: Catalogue data in Spring Semester 2017

Name Prof. Dr. Angelika Steger
FieldInformatik (Theoretische Informatik)
Inst. f. Theoretische Informatik
ETH Zürich, CAB G 37.2
Universitätstrasse 6
8092 Zürich
Award: The Golden Owl
Telephone+41 44 632 04 97
Fax+41 44 632 13 99
DepartmentComputer Science
RelationshipFull Professor

252-0030-00LAlgorithms and Probability Information 7 credits4V + 2UA. Steger, E. Welzl
AbstractFortsetzung der Vorlesung Algorithmen und Datenstrukturen des ersten Semesters. Es werden klassische Algorithmen aus verschiedenen Anwendungsbereichen vorgestellt. In die diskrete Wahrscheinlichkeitstheorie wird eingeführt und das Konzept randomisierter Algorithmen an verschiedenen Beispielen vorgestellt.
ObjectiveVerständnis des Entwurfs und der Analyse von Algorithmen. Grundlagen der diskreten Wahrscheinlichkeitstheorie und ihrer Anwendung in der Algorithmik.
252-4102-00LSeminar on Randomized Algorithms and Probabilistic Methods2 credits2SA. Steger
AbstractThe aim of the seminar is to study papers which bring the students to the forefront of today's research topics. This semester we will study selected papers of the conference Symposium on Discrete Algorithms (SODA17).
ObjectiveRead papers from the forefront of today's research; learn how to give a scientific talk.
Prerequisites / NoticeThe seminar is open for both students from mathematics and students from computer science. As prerequisite we require that you passed the course Randomized Algorithms and Probabilistic Methods (or equivalent, if you come from abroad).
252-4202-00LSeminar in Theoretical Computer Science Information 2 credits2SE. Welzl, B. Gärtner, M. Hoffmann, J. Lengler, A. Steger, B. Sudakov
AbstractPresentation of recent publications in theoretical computer science, including results by diploma, masters and doctoral candidates.
ObjectiveTo get an overview of current research in the areas covered by the involved research groups. To present results from the literature.
252-4220-00LA Taste of Research: Algorithms and Combinatorics Information Restricted registration - show details
Number of participants limited to 16.
2 credits2SB. Gärtner, A. Steger, M. Ghaffari
AbstractStudents work together with lecturers on open problems in algorithms and combinatorics.
ObjectiveThe goal is to learn and practice important research techniques: literature search, understanding and presenting research papers, developing ideas in the group, testing of conjectures with the computer, writing down results.
ContentWork on original research papers and open problems in the areas of algorithms and combinatorics.
Lecture notesNot available.
LiteratureWill be announced in the seminar.
Prerequisites / NoticePassed exam in Algorithms, Probability, and Computing.