Angelika Steger: Katalogdaten im Frühjahrssemester 2022

Name	Frau Prof. Dr. Angelika Steger
Lehrgebiet	Informatik (Theoretische Informatik)
Adresse	Inst. f. Theoretische Informatik ETH Zürich, OAT Z 27 Andreasstrasse 5 8092 Zürich SWITZERLAND
E-Mail	steger@inf.ethz.ch
URL	http://www.cadmo.ethz.ch/as/people/professor/asteger/index
Departement	Informatik
Beziehung	Ordentliche Professorin

Nummer	Titel	ECTS	Umfang	Dozierende
252-0030-00L	Algorithmen und Wahrscheinlichkeit	7 KP	4V + 2U	A. Steger, E. Welzl
Kurzbeschreibung	Es werden klassische Algorithmen aus verschiedenen Anwendungsbereichen vorgestellt. In die diskrete Wahrscheinlichkeitstheorie wird eingeführt und das Konzept randomisierter Algorithmen an verschiedenen Beispielen vorgestellt.
Lernziel	Verständnis des Entwurfs und der Analyse von Algorithmen. Grundlagen der diskreten Wahrscheinlichkeitstheorie und ihrer Anwendung in der Algorithmik.
Inhalt	Fortsetzung der Vorlesung Algorithmen und Datenstrukturen des ersten Semesters.
252-4102-00L	Seminar on Randomized Algorithms and Probabilistic Methods The deadline for deregistering expires at the end of the second week of the semester. Students who are still registered after that date, but do not attend the seminar, will officially fail the seminar. Number of participants limited to 24.	2 KP	2S	A. Steger
Kurzbeschreibung	The 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 (SODA22).
Lernziel	Read papers from the forefront of today's research; learn how to give a scientific talk.
Voraussetzungen / Besonderes	The 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-00L	Seminar in Theoretical Computer Science	2 KP	2S	E. Welzl, B. Gärtner, M. Hoffmann, J. Lengler, A. Steger, D. Steurer, B. Sudakov
Kurzbeschreibung	Presentation of recent publications in theoretical computer science, including results by diploma, masters and doctoral candidates.
Lernziel	To get an overview of current research in the areas covered by the involved research groups. To present results from the literature.
Voraussetzungen / Besonderes	This seminar takes place as part of the joint research seminar of several theory groups. Intended participation is for students with excellent performance only. Formal restriction is: prior successful participation in a master level seminar in theoretical computer science.
252-4225-00L	Presenting Theoretical Computer Science Number of participants limited to 24. The deadline for deregistering expires at the end of the second week of the semester. Students who are still registered after that date, but do not attend the seminar, will officially fail the seminar.	2 KP	2S	B. Gärtner, R. Kyng, A. Steger, D. Steurer, E. Welzl
Kurzbeschreibung	Students present current or classical results from theoretical computer science.
Lernziel	Students learn to read, understand and present results from theoretical computer science. The main focus and deliverable is a good presentation of 45 minutes that can easily be followed and understood by the audience.
Inhalt	Students present current or classical results from theoretical computer science.
Voraussetzungen / Besonderes	The seminar takes place as a block seminar on two Saturdays in April and/or May. Each presentation is jointly prepared and given by two students (procedure according to the seminar's Moodle page). All students must attend all presentations. Participation requires successful completion of the first year, or instructor approval.