Angelika Steger: Katalogdaten im Frühjahrssemester 2017 |  |
| 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 |
| 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 | 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. | ||||
| Lernziel | 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 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 (SODA17). | ||||
| 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, 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. | ||||
| 252-4220-00L | A Taste of Research: Algorithms and Combinatorics  Maximale Teilnehmerzahl: 16 | 2 KP | 2S | B. Gärtner, A. Steger, M. Ghaffari | |
| Kurzbeschreibung | Students work together with lecturers on open problems in algorithms and combinatorics. | ||||
| Lernziel | 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. | ||||
| Inhalt | Work on original research papers and open problems in the areas of algorithms and combinatorics. | ||||
| Skript | Not available. | ||||
| Literatur | Will be announced in the seminar. | ||||
| Voraussetzungen / Besonderes | Passed exam in Algorithms, Probability, and Computing. | ||||