Angelika Steger: Catalogue data in Spring Semester 2018

Name	Prof. Dr. Angelika Steger
Field	Informatik (Theoretische Informatik)
Address	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
Department	Computer Science
Relationship	Full Professor

Number	Title	ECTS	Hours	Lecturers
252-0030-00L	Algorithms and Probability	7 credits	4V + 2U	A. Steger, E. Welzl
Abstract	Fortsetzung 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.
Objective	Verständnis des Entwurfs und der Analyse von Algorithmen. Grundlagen der diskreten Wahrscheinlichkeitstheorie und ihrer Anwendung in der Algorithmik.
252-4102-00L	Seminar on Randomized Algorithms and Probabilistic Methods	2 credits	2S	A. Steger
Abstract	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 (SODA18).
Objective	Read papers from the forefront of today's research; learn how to give a scientific talk.
Prerequisites / Notice	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 credits	2S	E. Welzl, B. Gärtner, M. Hoffmann, J. Lengler, A. Steger, B. Sudakov
Abstract	Presentation of recent publications in theoretical computer science, including results by diploma, masters and doctoral candidates.
Objective	To get an overview of current research in the areas covered by the involved research groups. To present results from the literature.
252-4220-00L	A Taste of Research: Algorithms and Combinatorics Number of participants limited to 16.	2 credits	2S	B. Gärtner, A. Steger, M. Ghaffari
Abstract	Students work together with lecturers on open problems in algorithms and combinatorics.
Objective	The 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.
Content	Work on original research papers and open problems in the areas of algorithms and combinatorics.
Lecture notes	Not available.
Literature	Will be announced in the seminar.
Prerequisites / Notice	Passed exam in Algorithms, Probability, and Computing.
263-4110-00L	Interdisciplinary Algorithms Lab In the Master Programme max. 10 credits can be accounted by Labs on top of the Interfocus Courses. Additional Labs will be listed on the Addendum.	5 credits	2P	A. Steger, D. Steurer, J. Lengler
Abstract	In this course students will develop solutions for algorithmic problems posed by researchers from other fields.
Objective	Students will learn that in order to tackle algorithmic problems from an interdisciplinary or applied context one needs to combine a solid understanding of algorithmic methodology with insights into the problem at hand to judge which side constraints are essential and which can be loosened.
Prerequisites / Notice	Students will work in teams. Ideally, skills of team members complement each other. Interested Bachelor students can apply for participation by sending an email to steger@inf.ethz.ch explaining motivation and transcripts.