Peter Widmayer: Catalogue data in Spring Semester 2018 |  |
| Name | Prof. em. Dr. Peter Widmayer |
| Field | Informatik |
| Address | Inst. f. Theoretische Informatik ETH Zürich, CAB H 39.2 Universitätstrasse 6 8092 Zürich SWITZERLAND |
| widmayer@inf.ethz.ch | |
| Department | Computer Science |
| Relationship | Professor emeritus |
| Number | Title | ECTS | Hours | Lecturers | |
|---|---|---|---|---|---|
| 252-3002-00L | Algorithms for Database Systems  Limited number of participants. | 2 credits | 2S | P. Widmayer, P. Uznanski | |
| Abstract | Query processing, optimization, stream-based systems, distributed and parallel databases, non-standard databases. | ||||
| Learning objective | Develop an understanding of selected problems of current interest in the area of algorithms for database systems. | ||||
| 252-4230-00L | Advanced Algorithms and Data Structures Um das vorhandene Angebot optimal auszunutzen, behält sich das D-INFK vor, Belegungen von Studierenden zu löschen, die sich in mehreren Veranstaltungen dieser Kategorie eingeschrieben haben, bereits die erforderlichen Leistungen in dieser Kategorie erbracht haben oder aus anderen organisatorischen Gründen nicht auf die Belegung der Veranstaltung angewiesen sind. | 2 credits | 2S | P. Widmayer, S. Leucci, P. Uznanski | |
| Abstract | We will look into modern approaches of algorithms and data structures. A few breakthrough and highly influential papers from the general area of algorithms, from the past 20 years will be selected for students to study. | ||||
| Learning objective | Develop an understanding of modern techniques and paradigms in the design of algorithms and data structures. | ||||
| Content | Topics include (but are not exhausted by): -graph algorithms, -text algorithms, -approximation algorithms, -algebra in algorithms, -streaming algorithms, -conditional lower bounds, -sparsification, -randomness in algorithms, -sampling. | ||||
| Prerequisites / Notice | Algorithms and Data Structures, or equivalent. | ||||
| 252-4302-00L | Seminar Algorithmic Game Theory Limited number of participants. | 2 credits | 2S | P. Widmayer, P. Penna | |
| Abstract | In the seminar we will get familiar with the current original research in the area of algorithmic game theory by reading and presenting selected research papers in that area. | ||||
| Learning objective | Develop an understanding of selected problems of current interest in the area of algorithmic game theory, and a practice of a scientific presentation. | ||||
| Content | Study and understanding of selected topics of current interest in algorithmic game theory such as: Complexity Results (class PPAD, PLS, NP), Sponsored Search, Approximation Algorithms via Algorithmic Game Theory, Price of Anarchy, New paradigms of computation (e.g., envy-fee, truthful), Mechanism Design. | ||||
| Literature | Selected research articles. | ||||
| Prerequisites / Notice | You must have passed our "Algorithmic Game Theory" class (or have acquired equivalent knowledge, in exceptional cases). | ||||