Susanne Albers, Helmut Alt, Stefan Näher (Eds.):
Efficient Algorithms, Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday.
Lecture Notes in Computer Science 5760 Springer 2009, ISBN 978-3-642-03455-8 
Models of Computation and Complexity
Robert L. Constable:
Building Mathematics-Based Software Systems to Advance Science and Create Knowledge.
3-17
Günter Hotz:
Kolmogorov-Complexity Based on Infinite Computations.
55-73
Benjamin Doerr:
Introducing Quasirandomness to Computer Science.
99-111
Sorting and Searching
J. Ian Munro:
Reflections on Optimal and Nearly Optimal Binary Search Trees.
115-120
Raimund Seidel:
Maintaining Ideally Distributed Random Search Trees without Extra Space.
134-142
Torben Hagerup:
A Pictorial Description of Cole's Parallel Merge Sort.
143-157
Franco P. Preparata:
Self-matched Patterns, Golomb Rulers, and Sequence Reconstruction.
158-169
Combinatorial Optimization with Applications
Ulrich Meyer:
Via Detours to I/O-Efficient Shortest Paths.
219-232
Computational Geometry and Geometric Graphs
Helmut Alt:
The Computational Geometry of Comparing Shapes.
235-248
Michiel H. M. Smid:
The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension.
275-289
Petra Mutzel:
The Crossing Number of Graphs: Theory and Computation.
305-317
Algorithm Engineering, Exactness, and Robustness
Peter Sanders:
Algorithm Engineering - An Attempt at a Definition.
321-340
Stefan Funke:
Of What Use Is Floating-Point Arithmetic in Computational Geometry?
341-354
Hannah Bast:
Car or Public Transport - Two Worlds.
355-367
data released under the ODC-BY 1.0 license
