Bernd Gärtner: Catalogue data in Spring Semester 2017

Name Prof. Dr. Bernd Gärtner
Address
Inst. f. Theoretische Informatik
ETH Zürich, OAT Z 15
Andreasstrasse 5
8092 Zürich
SWITZERLAND
Telephone+41 44 632 70 26
Fax+41 44 632 10 63
E-mailgaertner@inf.ethz.ch
URLhttp://people.inf.ethz.ch/gaertner/
DepartmentComputer Science
RelationshipAdjunct Professor

NumberTitleECTSHoursLecturers
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.
252-4220-00LA Taste of Research: Algorithms and Combinatorics Information Restricted registration - show details
Number of participants limited to 16.
2 credits2SB. Gärtner, A. Steger, M. Ghaffari
AbstractStudents work together with lecturers on open problems in algorithms and combinatorics.
ObjectiveThe goal is to learn and practice important research techniques: literature search, understanding and presenting research papers, developing ideas in the group, testing of conjectures with the computer, writing down results.
ContentWork on original research papers and open problems in the areas of algorithms and combinatorics.
Lecture notesNot available.
LiteratureWill be announced in the seminar.
Prerequisites / NoticePassed exam in Algorithms, Probability, and Computing.
263-4203-00LGeometry: Combinatorics and Algorithms Information 2 credits2SB. Gärtner, M. Hoffmann, E. Welzl
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.