Bernd Gärtner: Catalogue data in Autumn Semester 2016 |
| 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 |
| gaertner@inf.ethz.ch | |
| URL | http://people.inf.ethz.ch/gaertner/ |
| Department | Computer Science |
| Relationship | Adjunct Professor |
| Number | Title | ECTS | Hours | Lecturers | |
|---|---|---|---|---|---|
| 252-0847-00L | Computer Science  | 5 credits | 2V + 2U | B. Gärtner | |
| Abstract | This lecture is an introduction to programming based on the language C++. We cover fundamental types, control statements, functions, arrays, and classes. The concepts will be motivated and illustrated through algorithms and applications. | ||||
| Learning objective | The goal of this lecture is an algorithmically oriented introduction to programming. | ||||
| Content | This lecture is an introduction to programming based on the language C++. We cover fundamental types, control statements, functions, arrays, and classes. The concepts will be motivated and illustrated through algorithms and applications. | ||||
| Lecture notes | Lecture notes in English and Handouts in German will be distributed electronically along with the course. | ||||
| Literature | Andrew Koenig and Barbara E. Moo: Accelerated C++, Addison-Wesley, 2000. Stanley B. Lippman: C++ Primer, 3. Auflage, Addison-Wesley, 1998. Bjarne Stroustrup: The C++ Programming Language, 3. Auflage, Addison-Wesley, 1997. Doina Logofatu: Algorithmen und Problemlösungen mit C++, Vieweg, 2006. Walter Savitch: Problem Solving with C++, Eighth Edition, Pearson, 2012 | ||||
| 252-1425-00L | Geometry: Combinatorics and Algorithms | 6 credits | 2V + 2U + 1A | B. Gärtner, E. Welzl, M. Hoffmann, A. Pilz | |
| Abstract | Geometric structures are useful in many areas, and there is a need to understand their structural properties, and to work with them algorithmically. The lecture addresses theoretical foundations concerning geometric structures. Central objects of interest are triangulations. We study combinatorial (Does a certain object exist?) and algorithmic questions (Can we find a certain object efficiently?) | ||||
| Learning objective | The goal is to make students familiar with fundamental concepts, techniques and results in combinatorial and computational geometry, so as to enable them to model, analyze, and solve theoretical and practical problems in the area and in various application domains. In particular, we want to prepare students for conducting independent research, for instance, within the scope of a thesis project. | ||||
| Content | Planar and geometric graphs, embeddings and their representation (Whitney's Theorem, canonical orderings, DCEL), polygon triangulations and the art gallery theorem, convexity in R^d, planar convex hull algorithms (Jarvis Wrap, Graham Scan, Chan's Algorithm), point set triangulations, Delaunay triangulations (Lawson flips, lifting map, randomized incremental construction), Voronoi diagrams, the Crossing Lemma and incidence bounds, line arrangements (duality, Zone Theorem, ham-sandwich cuts), 3-SUM hardness, counting planar triangulations. | ||||
| Lecture notes | yes | ||||
| Literature | Mark de Berg, Marc van Kreveld, Mark Overmars, Otfried Cheong, Computational Geometry: Algorithms and Applications, Springer, 3rd ed., 2008. Satyan Devadoss, Joseph O'Rourke, Discrete and Computational Geometry, Princeton University Press, 2011. Stefan Felsner, Geometric Graphs and Arrangements: Some Chapters from Combinatorial Geometry, Teubner, 2004. Jiri Matousek, Lectures on Discrete Geometry, Springer, 2002. Takao Nishizeki, Md. Saidur Rahman, Planar Graph Drawing, World Scientific, 2004. | ||||
| Prerequisites / Notice | Prerequisites: The course assumes basic knowledge of discrete mathematics and algorithms, as supplied in the first semesters of Bachelor Studies at ETH. Outlook: In the following spring semester there is a seminar "Geometry: Combinatorics and Algorithms" that builds on this course. There are ample possibilities for Semester-, Bachelor- and Master Thesis projects in the area. | ||||
| 252-4202-00L | Seminar in Theoretical Computer Science | 2 credits | 2S | E. Welzl, B. Gärtner, M. Hoffmann, J. Lengler, A. Steger, B. Sudakov | |
| Abstract | Presentation of recent publications in theoretical computer science, including results by diploma, masters and doctoral candidates. | ||||
| Learning objective | The goal is to introduce students to current research, and to enable them to read, understand, and present scientific papers. | ||||