Emo Welzl: Catalogue data in Spring Semester 2018 |  |
| Name | Prof. em. Dr. Emo Welzl |
| Name variants | Emo Welzl |
| Field | Computer Science |
| Address | Inst. f. Theoretische Informatik ETH Zürich, OAT Z 13.2 Andreasstrasse 5 8092 Zürich SWITZERLAND |
| Telephone | +41 44 632 73 70 |
| emo@inf.ethz.ch | |
| URL | http://www.inf.ethz.ch/personal/emo/ |
| Department | Computer Science |
| Relationship | Professor emeritus |
| 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. | ||||
| Learning objective | Verständnis des Entwurfs und der Analyse von Algorithmen. Grundlagen der diskreten Wahrscheinlichkeitstheorie und ihrer Anwendung in der Algorithmik. | ||||
| 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. | ||||
| Learning objective | To get an overview of current research in the areas covered by the involved research groups. To present results from the literature. | ||||
| 263-4203-00L | Geometry: Combinatorics and Algorithms | 2 credits | 2S | M. Hoffmann, E. Welzl, L. F. Barba Flores, P. Valtr | |
| Abstract | This seminar complements the course Geometry: Combinatorics & Algorithms. Students of the seminar will present original research papers, some classic and some of them very recent. | ||||
| Learning objective | Each student is expected to read, understand, and elaborate on a selected research paper. To this end, (s)he should give a 45-min. presentation about the paper. The process includes * getting an overview of the related literature; * understanding and working out the background/motivation: why and where are the questions addressed relevant? * understanding the contents of the paper in all details; * selecting parts suitable for the presentation; * presenting the selected parts in such a way that an audience with some basic background in geometry and graph theory can easily understand and appreciate it. | ||||
| Content | This seminar is held once a year and complements the course Geometry: Combinatorics & Algorithms. Students of the seminar will present original research papers, some classic and some of them very recent. The seminar is a good preparation for a master, diploma, or semester thesis in the area. | ||||
| Prerequisites / Notice | Prerequisite: Successful participation in the course "Geometry: Combinatorics & Algorithms" (takes place every HS) is required. | ||||