Suchergebnis: Katalogdaten im Frühjahrssemester 2019

Nummer	Titel	Typ	ECTS	Umfang	Dozierende
Informatik Master
Vertiefungsfächer
Vertiefung in Theoretical Computer Science
Seminar in Theoretical Computer Science
252-3002-00L	Algorithms for Database Systems Limited number of participants. The deadline for deregistering expires at the end of the second week of the semester. Students who are still registered after that date, but do not attend the seminar, will officially fail the seminar.	W	2 KP	2S	P. Penna
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 The deadline for deregistering expires at the end of the second week of the semester. Students who are still registered after that date, but do not attend the seminar, will officially fail the seminar.	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 (SODA18).
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 The deadline for deregistering expires at the end of the second week of the semester. Students who are still registered after that date, but do not attend the seminar, will officially fail the seminar.	W	2 KP	2S	A. Steger, B. Gärtner, M. Ghaffari, M. Hoffmann, J. Lengler, D. Steurer, 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.
Voraussetzungen / Besonderes	This seminar takes place as part of the joint research seminar of several theory groups. Intended participation is for students with excellent performance only. Formal minimal requirement is passing of one of the courses Algorithms, Probability, and Computing, Randomized Algorithms and Probabilistic Methods, Geometry: Combinatorics and Algorithms, Advanced Algorithms. (If you cannot fulfill this restriction, because this is your first term at ETH, but you believe that you satisfy equivalent criteria, please send an email with a detailed description of your reasoning to the organizers of the seminar.)
263-4203-00L	Geometry: Combinatorics and Algorithms The deadline for deregistering expires at the end of the second week of the semester. Students who are still registered after that date, but do not attend the seminar, will officially fail the seminar.	W	2 KP	2S	B. Gärtner, M. Hoffmann, C.‑H. Liu, M. Wettstein
Kurzbeschreibung	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.
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.
Inhalt	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.
Voraussetzungen / Besonderes	Prerequisite: Successful participation in the course "Geometry: Combinatorics & Algorithms" (takes place every HS) is required.

Seite 1 von 1