Kurt Mehlhorn | |
|---|---|
 | |
| Born | 29 August 1949 [1] |
| Alma mater | Cornell University [1] |
| Known for | LEDA |
| Awards |
|
| Scientific career | |
| Fields | Computer science |
| Institutions | Universität des Saarlandes |
| Doctoral advisor | Robert Lee Constable [2] |
Kurt Mehlhorn (born 29 August 1949) is a German theoretical computer scientist. He has been a vice president of the Max Planck Society and is 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 also served on the Engineering and Computer Science jury for the Infosys Prize from 2009 to 2011. [3]
He won the Gottfried Wilhelm Leibniz Prize in 1986, the Gay-Lussac-Humboldt-Prize in 1989, the Karl Heinz Beckurts Award in 1994, the Konrad Zuse Medal in 1995, the EATCS Award in 2010, [4] and the Paris Kanellakis Award in 2010. He was named a member of the Academia Europaea in 1995, Fellow of the Association for Computing Machinery in 1999, a member of the Berlin-Brandenburg Academy of Sciences in 2001, a member of the German Academy of Sciences Leopoldina in 2004, a foreign member of the National Academy of Engineering in 2014, and a foreign member of the National Academy of Sciences in 2014. [5] He has received honorary doctorates from the Otto von Guericke University of Magdeburg in 2002 and the University of Waterloo in 2006. [1] [2] [6] He is the 2014 winner of the Erasmus Medal of the Academia Europaea. [7]
Mehlhorn is the author of several books and over 250 scientific publications, [8] which include fundamental contributions to data structures, computational geometry, computer algebra, parallel computing, VLSI design, computational complexity, combinatorial optimization, and graph algorithms. [4]
Mehlhorn has been an important figure in the development of algorithm engineering and is one of the developers of LEDA, the Library of Efficient Data types and Algorithms.
Mehlhorn has played an important role in the establishment of several research centres for computer science in Germany. He was the driving force [4] behind the establishment of a Max Planck Institute for Computer Science in Germany, the Max Planck Institute for Computer Science (MPII). Mehlhorn is managing director of the institute and heads the department of algorithms and complexity. He also initiated [4] the research center for computer science at Dagstuhl and the European Symposium on Algorithms.
.
Discrete mathematics is the study of mathematical structures that can be considered "discrete" rather than "continuous". Objects studied in discrete mathematics include integers, graphs, and statements in logic. By contrast, discrete mathematics excludes topics in "continuous mathematics" such as real numbers, calculus or Euclidean geometry. Discrete objects can often be enumerated by integers; more formally, discrete mathematics has been characterized as the branch of mathematics dealing with countable sets. However, there is no exact definition of the term "discrete mathematics".
Computational geometry is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry. Some purely geometrical problems arise out of the study of computational geometric algorithms, and such problems are also considered to be part of computational geometry. While modern computational geometry is a recent development, it is one of the oldest fields of computing with a history stretching back to antiquity.
Theoretical computer science is a subfield of computer science and mathematics that focuses on the abstract and mathematical foundations of computation.
Combinatorics is a branch of mathematics concerning the study of finite or countable discrete structures.
The Max Planck Institute for Informatics is a research institute in computer science with a focus on algorithms and their applications in a broad sense. It hosts fundamental research as well a research for various application domains.
Samson Abramsky is a British computer scientist who is a Professor of Computer Science at University College London. He was previously the Christopher Strachey Professor of Computing at Wolfson College, Oxford, from 2000 to 2021.
Noga Alon is an Israeli mathematician and a professor of mathematics at Princeton University noted for his contributions to combinatorics and theoretical computer science, having authored hundreds of papers.
The Library of Efficient Data types and Algorithms (LEDA) is a proprietarily-licensed software library providing C++ implementations of a broad variety of algorithms for graph theory and computational geometry. It was originally developed by the Max Planck Institute for Informatics Saarbrücken. Since 2001, LEDA is further developed and distributed by the Algorithmic Solutions Software GmbH.
Michael Ralph Fellows AC HFRSNZ MAE is a computer scientist and the Elite Professor of Computer Science in the Department of Informatics at the University of Bergen, Norway as of January 2016.
Herbert Edelsbrunner is a computer scientist working in the field of computational geometry, the Arts & Science Professor of Computer Science and Mathematics at Duke University, Professor at the Institute of Science and Technology Austria (ISTA), and the co-founder of Geomagic, Inc. He was the first of only three computer scientists to win the National Science Foundation's Alan T. Waterman Award.
János Pach is a mathematician and computer scientist working in the fields of combinatorics and discrete and computational geometry.
In computing, especially computational geometry, a real RAM is a mathematical model of a computer that can compute with exact real numbers instead of the binary fixed point or floating point numbers used by most actual computers. The real RAM was formulated by Michael Ian Shamos in his 1978 Ph.D. dissertation.
Susanne Albers is a German theoretical computer scientist and professor of computer science at the Department of Informatics of the Technical University of Munich. She is a recipient of the Otto Hahn Medal and the Leibniz Prize.
Pankaj Kumar Agarwal is an Indian computer scientist and mathematician researching algorithms in computational geometry and related areas. He is the RJR Nabisco Professor of Computer Science and Mathematics at Duke University, where he has been chair of the computer science department since 2004. He obtained his Doctor of Philosophy (Ph.D.) in computer science in 1989 from the Courant Institute of Mathematical Sciences, New York University, under the supervision of Micha Sharir.
Emmerich (Emo) Welzl is a computer scientist known for his research in computational geometry. He is a professor in the Institute for Theoretical Computer Science at ETH Zurich in Switzerland.
Thomas Lengauer is a German computer scientist and computational biologist.
Naveen Garg is a Professor of Computer Science in Indian Institute of Technology Delhi, specializing in algorithms and complexity in theoretical computer science. He was awarded the Shanti Swarup Bhatnagar Prize for Science and Technology, India's highest prize for excellence in science, mathematics and technology, in the mathematical sciences category in the year 2016. Naveen Garg's contributions are primarily in the design and analysis of approximation algorithms for NP-hard combinatorial optimization problems arising in network design, scheduling, routing, facility location etc.
Jean Vuillemin is a French computer scientist known for his work in data structures and parallel computing. He is a professor of computer science at the École normale supérieure (Paris).
Helmut Alt is a German computer scientist whose research concerns graph algorithms and computational geometry. He is known for his work on matching geometric shapes, including methods for efficiently computing the Fréchet distance between shapes. He was also the first to use the German phrase "Algorithmische Geometrie" [algorithmic geometry] to refer to computational geometry. He is a professor of computer science at the Free University of Berlin.
| International | |
|---|---|
| National | |
| Academics | |
| People | |
| Other | |
