Your search returned the following 3 documents:

3. Amortisierte Analyse
   Kurt Mehlhorn
   In: Prinzipien des Algorithmenentwurfs, 1998, 91-102
   [PDF: Download: mehlhorn120.pdf]
   
2. A Lower Bound for the Complexity of the Union-Split-Find Problem
   Kurt Mehlhorn, Stefan Näher, and Helmut Alt
   In: Automata, Languages and Programming (ICALP-87) : 14th International Colloquium, Karlsruhe, Federal Republic of Germany, 1987, 479-488
   
1. Selected Topics from Computational Geometry, Data Structures and Motion Planning
   Rudolf Fleischer, Otfried Fries, Kurt Mehlhorn, Stefan Meiser, Stefan Näher, Hans Rohnert, Stefan Schirra, Klaus Simon, Athanasios Tsakalidis, and Christian Uhrig
   In: Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative, 1992, 25-43