Emo Welzl: Catalogue data in Spring Semester 2020

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
E-mail	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	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.
Content	Fortsetzung der Vorlesung Algorithmen und Datenstrukturen des ersten Semesters.
252-4202-00L	Seminar in Theoretical Computer Science	2 credits	2S	E. Welzl, B. Gärtner, M. Ghaffari, M. Hoffmann, J. Lengler, A. Steger, D. Steurer, 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.
Prerequisites / Notice	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 restriction is: prior successful participation in a master level seminar in theoretical computer science.
252-4225-00L	Presenting Theoretical Computer Science Number of participants limited to 24. 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.	2 credits	2S	B. Gärtner, M. Ghaffari, R. Kyng, A. Steger, D. Steurer, E. Welzl
Abstract	Students present current or classical results from theoretical computer science.
Learning objective	Students learn to read, understand and present results from theoretical computer science. The main focus and deliverable is a good presentation of 45 minutes that can easily be followed and understood by the audience.
Content	Students present current or classical results from theoretical computer science.
Prerequisites / Notice	The seminar takes place as a block seminar on two Saturdays in April and/or May. Each presentation is jointly prepared and given by two students (procedure according to the seminar website). All students must attend all presentations.
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.	2 credits	2S	B. Gärtner, M. Hoffmann, E. Welzl, M. Wettstein
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.