معرفی
Prof. Bernd Gärtner is a Lecturer at the Department of Computer Science of ETH Zürich. His research focuses on algorithms, computational geometry, optimization, and theoretical computer science. He has contributed significantly to the study of unique sink orientations, combinatorial algorithms, and algorithm design. Gärtner teaches courses such as 'Algorithms, Probability, and Computing' and 'Geometry: Combinatorics and Algorithms,' reflecting his expertise in foundational computer science topics. His work bridges discrete mathematics and algorithmic theory, addressing challenges in linear programming, combinatorial optimization, and geometric algorithms.
His recent research explores the realizability of structures in unique sink orientations, optimization techniques for symbolic visibility, and the analysis of opinion dynamics in networks. He has published extensively on topics including ARRIVAL game complexity, sampling algorithms, and high-dimensional learning models. His contributions also extend to the development of efficient algorithms for geometric problems and the study of cellular automata systems.
- Teaching: Courses include Algorithms, Probability, and Computing (252-0209-00L), Linear Algebra (401-0131-00L), and Geometry: Combinatorics and Algorithms.
- Research Interests: Algorithms, computational geometry, optimization, combinatorics, and theoretical computer science.
- Labs/Teams: Affiliated with the Institute of Theoretical Computer Science at ETH Zürich.
