MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 6 documents:

  1. A reliable randomized algorithm for the closest-pair problem
    Martin Dietzfelbinger, Torben Hagerup, Jyrki Katajainen, and Martti Penttonen
    Journal of Algorithms 25 (1): 19-51, 1997
  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
    SIAM Journal on Computing 23 (4): 738-761, 1994

  3. A Perfect Parallel Dictionary
    Holger Bast, Martin Dietzfelbinger, and Torben Hagerup
    In: 17th International Symposium on Mathematical Foundations of Computer Science (MFCS'92), Prague, Czechoslovakia, 1992, 133-141
  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
    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.
  5. 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
  6. Upper and Lower Bounds for the Dictionary Problem
    Martin Dietzfelbinger, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, and H. Rohnert
    In: Algorithm theory (SWAT-88) : 1st Scandinavian workshop, Halmstad, Sweden, 1988, 214-215