Your search returned the following 4 documents:

4. Dynamic Perfect Hashing: Upper and Lower Bounds
   Martin Dietzfelbinger, Anna Karlin, Kurt Mehlhorn, Friedhelm Meyer Auf Der Heide, Hans Rohnert, and Robert E. Tarjan
   SIAM Journal on Computing 23 (4): 738-761, 1994
   
   
3. 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
   
2. Dynamic Perfect Hashing: Upper and Lower Bounds
   Martin Dietzfelbinger, Anna Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, and Robert E. Tarjan
   In: 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), White Plains, New York, USA, 1988, 524-531
   
1. Dynamic Perfect Hashing: Upper and Lower Bounds
   Martin Dietzfelbinger, Anna Karlin, Kurt Mehlhorn, Friedhelm Meyer Auf Der Heide, Hans Rohnert, and Robert E. Tarjan
   Princeton University, Princeton, TR-310-91. Note: This technical report has been published as Dynamic Perfect Hashing: Upper and Lower Bounds. Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert and Robert E. Tarjan, Proc. 29th Annual IEEE Symp. on Foundations of Computer Science (1988), 524-531 and SIAM J. Comput. 23 (1994) 738-761.