Emo Welzl: Catalogue data in Spring Semester 2018

Award: The Golden Owl
Name Prof. em. Dr. Emo Welzl
Name variantsEmo Welzl
FieldComputer 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
Fax+41 44 632 10 63
E-mailemo@inf.ethz.ch
URLhttp://www.inf.ethz.ch/personal/emo/
DepartmentComputer Science
RelationshipProfessor emeritus

NumberTitleECTSHoursLecturers
252-0030-00LAlgorithms and Probability Information 7 credits4V + 2UA. Steger, E. Welzl
AbstractFortsetzung 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.
ObjectiveVerständnis des Entwurfs und der Analyse von Algorithmen. Grundlagen der diskreten Wahrscheinlichkeitstheorie und ihrer Anwendung in der Algorithmik.
252-4202-00LSeminar in Theoretical Computer Science Information 2 credits2SE. Welzl, B. Gärtner, M. Hoffmann, J. Lengler, A. Steger, B. Sudakov
AbstractPresentation of recent publications in theoretical computer science, including results by diploma, masters and doctoral candidates.
ObjectiveTo get an overview of current research in the areas covered by the involved research groups. To present results from the literature.
263-4203-00LGeometry: Combinatorics and Algorithms Information 2 credits2SM. Hoffmann, E. Welzl, L. F. Barba Flores, P. Valtr
AbstractThis seminar complements the course Geometry: Combinatorics & Algorithms. Students of the seminar will present original research papers, some classic and some of them very recent.
ObjectiveEach 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.
ContentThis 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 / NoticePrerequisite: Successful participation in the course "Geometry: Combinatorics & Algorithms" (takes place every HS) is required.