Kurt Mehlhorn
From Wikipedia, the free encyclopedia
Kurt Mehlhorn (born August 29, 1949 in Ingolstadt, Germany) is a German computer scientist, a vice president of the Max Planck Society and director of the Max Planck Institute for Computer Science.
Mehlhorn graduated in 1971 from the Technical University of Munich, where he studied computer science and mathematics, and earned his Ph.D. in 1974 from Cornell University under the supervision of Robert Constable. Since 1975 he has been on the faculty of Saarland University in Saarbrücken, Germany, where he was chair of the computer science department from 1976 to 1978 and again from 1987 to 1989. Since 1990 has been the director of the Max Planck Institute for Computer Science, also in Saarbrücken. He has been on the editorial boards of ten journals, a trustee of the International Computer Science Institute in Berkeley, California, and a member of the board of governors of Jacobs University Bremen. He won the Gottfried Wilhelm Leibniz Prize in 1986, the Karl Heinz Beckurts Award in 1994, and the Konrad Zuse Medal in 1995. He was named a Fellow of the Association of Computing Machinery in 1999, a member of the Berlin-Brandenburg Academy of Sciences in 2001, and a member of the German Academy of Sciences Leopoldina in 2004. He has received honorary doctorates from the Otto von Guericke University of Magdeburg in 2004 and the University of Waterloo in 2006.[1][2][3]
Mehlhorn has over 250 scientific publications.[4] He is best known as one of the developers of LEDA, the Library of Efficient Data types and Algorithms; he is also known for his work on shortest path algorithms, perfect hashing, parallel algorithms, and computational geometry.
[edit] Books
- Mehlhorn, Kurt (1977), Effiziente Algorithmen, Stuttgart: Teubner. Revised and translated as Data Structures and Algorithms, Springer-Verlag, 1984.
- Mehlhorn, Kurt (1984), Data Structures and Algorithms II: Graph Algorithms and NP-completeness, Springer-Verlag.
- Mehlhorn, Kurt (1984), Data Structures and Algorithms III: Multidimensional Searching and Computational Geometry, Springer-Verlag.
- Loeckx, Jacques; Mehlhorn, Kurt & Wilhelm, Reinhard (1988), Foundations of Programming Languages, J. Wiley, ISBN 0471921394.
- Mehlhorn, Kurt & Näher, Stefan (1999), LEDA: A Platform for Combinatorial and Geometric Computing, Cambridge University Press, ISBN 978-0521563291.
[edit] Selected publications
- Mehlhorn, Kurt & Schmidt, Erik M. (1982), “Las Vegas is better than determinism in VLSI and distributed computing”, Proc. 14th ACM Symp. Theory of Computing (STOC), pp. 330–337, DOI 10.1145/800070.802208.
- Mehlhorn, Kurt & Vishkin, Uzi (1984), “Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories”, Acta Informatica 21 (4): 339–374, DOI 10.1007/BF00264615.
- Alt, Helmut; Mehlhorn, Kurt; Wagener, Hubert & Welzl, Emo (1988), “Congruence, similarity, and symmetries of geometric objects”, Discrete and Computational Geometry 3 (1): 237–256, DOI 10.1007/BF02187910.
- Ahuja, Ravindra K.; Mehlhorn, Kurt; Orlin, James B. & Tarjan, Robert E. (1990), “Faster algorithms for the shortest path problem”, Journal of the Association for Computing Machinery 37 (2): 213–223, DOI 10.1145/77600.77615.
- Dietzfelbinger, Martin; Karlin, Anna; Mehlhorn, Kurt & Meyer auf der Heide, Friedhelm (1994), “Dynamic perfect hashing: upper and lower bounds”, SIAM Journal on Computing 23 (4): 738–761, DOI 10.1137/S0097539791194094.
[edit] References
- ^ Mehlhorn's CV.
- ^ Kurt Mehlhorn at the website of the Mathematics Genealogy Project.
- ^ ACM Fellow citation to Mehlhorn for "important contributions in complexity theory and in the design, analysis, and practice of combinatorial and geometric algorithms."
- ^ Mehlhorn's publications at DBLP.
