60. Birthday: Kurt Mehlhorn 2009

Models of Computation and Complexity

• Robert L. Constable:
  Building Mathematics-Based Software Systems to Advance Science and Create Knowledge. 3-17
  
• Norbert Blum:
  On Negations in Boolean Networks. 18-29
  
• Heidi Gebauer, Robin A. Moser, Dominik Scheder, Emo Welzl:
  The Lovász Local Lemma and Satisfiability. 30-54
  
• Günter Hotz:
  Kolmogorov-Complexity Based on Infinite Computations. 55-73
  
• Ulan Degenbaev, Wolfgang J. Paul, Norbert Schirmer:
  Pervasive Theory of Memory. 74-98
  
• 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
  
• Athanasios K. Tsakalidis:
  Some Results for Elementary Operations. 121-133
  
• 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

• Susanne Albers:
  Algorithms for Energy Saving. 173-186
  
• Naveen Garg:
  Minimizing Average Flow-Time. 187-198
  
• Ernst Althaus, Gunnar W. Klau, Oliver Kohlbacher, Hans-Peter Lenhof, Knut Reinert:
  Integer Linear Programming in Computational Biology. 199-218
  
• 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
  
• Tetsuo Asano, Sergey Bereg, David G. Kirkpatrick:
  Finding Nearest Larger Neighbors. 249-260
  
• Stefan Näher, Daniel Schmitt:
  Multi-core Implementations of Geometric Algorithms. 261-274
  
• Michiel H. M. Smid:
  The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension. 275-289
  
• Michael Kaufmann:
  On Map Labeling with Leaders. 290-304
  
• 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
  
• Rudolf Fleischer:
  Is the World Linear? 368-379
  
• Chee-Keng Yap:
  In Praise of Numerical Computation. 380-407
  
• Stefan Schirra:
  Much Ado about Zero. 408-421
  
• Thomas Gawlitza, Jérôme Leroux, Jan Reineke, Helmut Seidl, Grégoire Sutre, Reinhard Wilhelm:
  Polynomial Precise Interval Analysis Revisited. 422-437