Kurt Mehlhorn

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. [http://www.mpi-inf.mpg.de/~mehlhorn/cv.html Mehlhorn's CV] .] mathgenealogy|name=Kurt Mehlhorn|id=35475.] [http://fellows.acm.org/fellow_citation.cfm?id=1424282&srt=all ACM Fellow citation to Mehlhorn] for "important contributions in complexity theory and in the design, analysis, and practice of combinatorial and geometric algorithms."]

Mehlhorn has over 250 scientific publications. [ [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/m/Mehlhorn:Kurt.html Mehlhorn's publications] at DBLP.] 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.

Books

*citation
last1 = Mehlhorn | first1 = Kurt
title = Effiziente Algorithmen
location = Stuttgart | publisher = Teubner | year = 1977. Revised and translated as "Data Structures and Algorithms", Springer-Verlag, 1984.

*citation
last1 = Mehlhorn | first1 = Kurt
title = Data Structures and Algorithms II: Graph Algorithms and NP-completeness
publisher = Springer-Verlag | year = 1984.

*citation
last1 = Mehlhorn | first1 = Kurt
title = Data Structures and Algorithms III: Multidimensional Searching and Computational Geometry
publisher = Springer-Verlag | year = 1984.

*citation
first1 = Jacques | last1 = Loeckx
first2 = Kurt | last2 = Mehlhorn
first3 = Reinhard | last3 = Wilhelm
title = Foundations of Programming Languages
publisher = J. Wiley | year = 1988 | isbn = 0471921394.

*citation
last1 = Mehlhorn | first1 = Kurt | last2 = Näher | first2 = Stefan
title = LEDA: A Platform for Combinatorial and Geometric Computing
publisher = Cambridge University Press | year = 1999
isbn = 978-0521563291.

elected publications

*citation
last1 = Mehlhorn | first1 = Kurt
last2 = Schmidt | first2 = Erik M.
contribution = Las Vegas is better than determinism in VLSI and distributed computing
title = Proc. 14th ACM Symp. Theory of Computing (STOC)
year = 1982 | pages = 330–337 | doi = 10.1145/800070.802208.

*citation
last1 = Mehlhorn | first1 = Kurt
last2 = Vishkin | first2 = Uzi
title = Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
journal = Acta Informatica
volume = 21 | issue = 4 | year = 1984 | pages = 339–374
doi = 10.1007/BF00264615.

*citation
last1 = Alt | first1 = Helmut
last2 = Mehlhorn | first2 = Kurt
last3 = Wagener | first3 = Hubert
last4 = Welzl | first4 = Emo
title = Congruence, similarity, and symmetries of geometric objects
journal = Discrete and Computational Geometry
volume = 3 | issue = 1 | year = 1988 | pages = 237–256
doi = 10.1007/BF02187910.

*citation
last1 = Ahuja | first1 = Ravindra K.
first2 = Kurt | last2 = Mehlhorn
last3 = Orlin | first3 = James B.
last4 = Tarjan | first4 = Robert E. | authorlink4 = Robert Tarjan
title = Faster algorithms for the shortest path problem
journal = Journal of the Association for Computing Machinery
volume = 37 | issue = 2 | year = 1990 | pages = 213–223
doi = 10.1145/77600.77615.

*citation
last1 = Dietzfelbinger | first1 = Martin
last2 = Karlin | first2 = Anna
last3 = Mehlhorn | first3 = Kurt
last4 = Meyer auf der Heide, Friedhelm
title = Dynamic perfect hashing: upper and lower bounds
journal = SIAM Journal on Computing
volume = 23 | issue = 4 | year = 1994 | pages = 738–761
doi = 10.1137/S0097539791194094.

References