Prof. Dr.

Emo Welzl

Corresponding Member of the Division of Mathematics and Natural Sciences abroad since 2014

  • Department of Computer Science, Eidgenössische Technische Hochschule Zürich

Research Areas:

  • Computer Sciences
  • Theoretical cybernetics
  • Combinatorics
  • Applied geometry
  • Algorithmik
  • Theoretische Informatik

Profile:

CV/Website

Selected Memberships:

  • Berlin-Brandenburgische Akademie der Wissenschaften
  • Deutsche Akademie der Naturforscher Leopoldina - Nationale Akademie der Wissenschaften
  • Academia Europaea

Selected Prizes:

  • Gottfried Wilhelm Leibniz-Preis der Deutschen Forschungsgemeinschaft
  • Max-Planck-Forschungspreis
  • Fellow of the Association of Computing Machinery (ACM)

Selected Publications:

  • Sharir, M.; Welzl, E. (2006) Random triangulations of planar point sets., Proceedings 22nd Annual ACM Symposium on Computational Geometry (SoCG), S. 273-281.
  • Matousek, J.; Sharir, M.; Welzl, E. (1996) A subexponential bound for linear programming. Algorithmica, Bd. 16, S. 498-516.
  • Welzl, Emo (1988) Partition trees for triangle counting and other range searching problems., Proceedings 4th Annual ACM Symposium on Computational Geometry (SoCG), S. 23-33.
  • Haussler, D.; Welzl, E. (1987) Epsilon-nets and simplex range queries. Discrete and Computational Geometry, Bd. 2, S. 127-151.
  • Welzl, Emo (1982) Color families are dense. Theoretical Computer Science, Bd. 17, S. 29-41.