Suchergebnis: Katalogdaten im Frühjahrssemester 2016
Informatik Master | ||||||
Vertiefungsfächer | ||||||
Vertiefung in Theoretical Computer Science | ||||||
Seminar in Theoretical Computer Science | ||||||
Nummer | Titel | Typ | ECTS | Umfang | Dozierende | |
---|---|---|---|---|---|---|
252-3002-00L | Algorithms for Database Systems Limited number of participants. | W | 2 KP | 2S | P. Widmayer | |
Kurzbeschreibung | Query processing, optimization, stream-based systems, distributed and parallel databases, non-standard databases. | |||||
Lernziel | Develop an understanding of selected problems of current interest in the area of algorithms for database systems. | |||||
252-4102-00L | Seminar on Randomized Algorithms and Probabilistic Methods | W | 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 (SODA16). | |||||
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 | W | 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-4302-00L | Seminar Algorithmic Game Theory Limited number of participants. | W | 2 KP | 2S | P. Widmayer, P. Dütting | |
Kurzbeschreibung | 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. | |||||
Lernziel | Develop an understanding of selected problems of current interest in the area of algorithmic game theory, and a practice of a scientific presentation. | |||||
Inhalt | 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. | |||||
Literatur | Selected research articles. | |||||
Voraussetzungen / Besonderes | You must have passed our "Algorithmic Game Theory" class (or have acquired equivalent knowledge, in exceptional cases). | |||||
252-4800-00L | Quantum Information and Cryptography | W | 2 KP | 3S | S. Wolf | |
Kurzbeschreibung | Es werden verschiedene Themen im Grenzgebiet der Bereiche Quantenphysik, Informationstheorie und Kryptographie behandelt. | |||||
Lernziel | Themen im Grenzgebiet der Bereiche Quantenphysik, Informationstheorie und Kryptographie werden behandelt. | |||||
263-4203-00L | Geometry: Combinatorics and Algorithms | W | 2 KP | 2S | B. Gärtner, M. Hoffmann, E. Welzl | |
Kurzbeschreibung | 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. | |||||
Lernziel | 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. | |||||
Voraussetzungen / Besonderes | To attend the seminar, some knowledge in (discrete and computational) geometry and graphs and algorithms is required. Thus, previous participation in the course "Geometry: Combinatorics & Algorithms" or a comparable course is strongly encouraged. |
- Seite 1 von 1