Bernd Gärtner: Catalogue data in Spring Semester 2014 |
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-4202-00L | Seminar in Theoretical Computer Science | 2 credits | 2S | E. Welzl, B. Gärtner, M. Hoffmann, J. Lengler, A. Steger | |
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. | ||||
252-4220-00L | A Taste of Research: Algorithms and Combinatorics | 2 credits | 2S | B. Gärtner, J. Matousek, A. Steger, E. Welzl, P. Widmayer | |
Abstract | Students work together with lecturers on open problems in algorithms and combinatorics. | ||||
Learning objective | The 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. | ||||
Content | Work on original research papers and open problems in the areas of algorithms and combinatorics. | ||||
Lecture notes | Not available. | ||||
Literature | Will be announced in the seminar and on the seminar's web page. | ||||
Prerequisites / Notice | Passed first-year exam. | ||||
401-5900-00L | Optimization and Applications | 0 credits | 2K | R. Weismantel, B. Gärtner, D. Klatte, J. Lygeros, M. Morari, K. Schmedders, R. Smith, R. Zenklusen | |
Abstract | Lectures on current topics in optimization. | ||||
Learning objective | This lecture series introduces graduate students to ongoing research activities (including applications) in the domain of optimization. | ||||
Content | This seminar is a forum for researchers interested in optimization theory and its applications. Speakers, invited from both academic and non-academic institutions, are expected to stimulate discussions on theoretical and applied aspects of optimization and related subjects. The focus is on efficient (or practical) algorithms for continuous and discrete optimization problems, complexity analysis of algorithms and associated decision problems, approximation algorithms, mathematical modeling and solution procedures for real-world optimization problems in science, engineering, industries, public sectors etc. |