astronomy

Kurt Mehlhorn

Kurt Mehlhorn is a astronomy topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Kurt Mehlhorn rather than just read about it. In short: 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.

Key takeaways

Kurt Mehlhorn belongs to astronomy; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Kurt Mehlhorn to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Kurt Mehlhorn from memory before moving on to harder problems.

Reference excerpt

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.

Education and career 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.

Awards and honors 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, 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. He has received honorary doctorates from the Otto von Guericke University of Magdeburg in 2002 and the University of Waterloo in 2006. He is the 2014 winner of the Erasmus Medal of the Academia Europaea. In 2025 he was awarded with the Saarland Order of Merit.

Research Mehlhorn is the author of several books and over 250 scientific publications, which include fundamental contributions to data structures, computational geometry, computer algebra, parallel computing, VLSI design, computational complexity, combinatorial optimization, and graph algorithms. 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 behind the establishment of a Max Planck Institute for Computer Science in Germany, the Max Planck Institute for Computer Science (MPII). Mehlhorn was managing director of the institute and headed the department of algorithms and complexity. He was also a driving force in establishing the research center for computer science at Dagstuhl and an initiator of the European Symposium on Algorithms. Mehlhorn has also contributed to the development of fair item allocation algorithms. In particular, he participated in proving the existence of envy-free up to any item allocations for three agents with additive valuations, which was considered an important open problem.

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 978-0-471-92139-4. Mehlhorn, Kurt; Näher, Stefan (1999), LEDA: A Platform for Combinatorial and Geometric Computing, Cambridge University Press, ISBN 978-0-521-56329-1. Mehlhorn, Kurt; Sanders, Peter (2008), Algorithms and Data Structures: The Basic Toolbox, Springer, ISBN 978-3-540-77977-3.

Selected publications Mehlhorn, Kurt; Schmidt, Erik M. (1982), "Las Vegas is better than determinism in VLSI and distributed computing" (PDF), Proc. 14th ACM Symp. Theory of Computing (STOC), pp. 330–337, doi:10.1145/800070.802208, ISBN 978-0897910705, S2CID 17932779. Mehlhorn, Kurt; Vishkin, Uzi (November 1984), "Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories" (PDF), Acta Informatica, 21 (4): 339–374, doi:10.1007/BF00264615, S2CID 29789494. Alt, Helmut; Mehlhorn, Kurt; Wagener, Hubert; Welzl, Emo (1988), "Congruence, similarity, and symmetries of geometric objects" (PDF), Discrete and Computational Geometry, 3 (1): 237–256, doi:10.1007/BF02187910, S2CID 5855400. Ahuja, Ravindra K.; Mehlhorn, Kurt; Orlin, James B.; Tarjan, Robert E. (April 1990), "Faster algorithms for the shortest path problem" (PDF), Journal of the Association for Computing Machinery, 37 (2): 213–223, CiteSeerX 10.1.1.85.5847, doi:10.1145/77600.77615, hdl:1721.1/47994, S2CID 5499589 {{citation}}: Cite uses deprecated parameter |citeseerx= (help). Dietzfelbinger, Martin; Karlin, Anna; Mehlhorn, Kurt; Meyer auf der Heide, Friedhelm; Rohnert, Hans; Tarjan, Robert E. (1994), "Dynamic perfect hashing: upper and lower bounds", SIAM Journal on Computing, 23 (4): 738–761, CiteSeerX 10.1.1.30.8165, doi:10.1137/S0097539791194094 {{citation}}: Cite uses deprecated parameter |citeseerx= (help). Also available as Princeton TR-310-91.

References

Illustrations

Worked examples

Example 1 — a first encounter with Kurt Mehlhorn

Start with the simplest possible case. Write down what Kurt Mehlhorn claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In astronomy, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Kurt Mehlhorn before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Kurt Mehlhorn ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Kurt Mehlhorn

In research: Kurt Mehlhorn appears in astronomy research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Kurt Mehlhorn in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Kurt Mehlhorn is common in secondary-school and first-year university syllabi. It links to neighbouring topics 1949 births, Academic staff of Saarland University, Cornell University alumni, so understanding it makes those chapters shorter.
In everyday life: Look for Kurt Mehlhorn outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Kurt Mehlhorn” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Kurt Mehlhorn in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Kurt Mehlhorn means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Kurt Mehlhorn out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Kurt Mehlhorn in simple terms?

Why does Kurt Mehlhorn matter?

Because it connects several astronomy ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Kurt Mehlhorn?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Kurt Mehlhorn.