Dynamic hashing strategies

  • Friedhelm Meyer auf der Heide
Invited Lectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 452)


This survey paper describes new types of dynamic hashing strategies for implementing dictionaries on sequential, parallel and distributed computation models. In particular, it surveys the progress in constructing and analyzing new classes of universal hash functions.


Hash Function Shared Memory Parallel Machine Hash Table Reconstruction Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6 References

  1. [Me 84]
    K. Mehlhorn, Data structures and algorithms, Vol. 1, Springer Verlag, 1984.Google Scholar
  2. [FKS 84]
    M. L. Fredman, J. Komlós, E. Szemerédi, Storing a sparse table with O(1) worst case access time, J. ACM 31(3), pp. 538–544, 1984.Google Scholar
  3. [DK* 88]
    M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, R. E. Tarjan, Dynamic perfect hashing: upper and lower bounds, Proc. of 29th IEEE FOCS, pp. 524–531, 1988.Google Scholar
  4. [DM 90]
    M. Dietzfelbinger, F. Meyer auf der Heide: A new universal class of hash functions, and dynamic hashing in real time, Proc. of 17th ICALP, 1990.Google Scholar
  5. [DMa 90]
    M. Dietzfelbinger, F. Meyer auf der Heide: How to distribute a dictionary in a complete network, Proc. of 22nd ACM STOC, 1990.Google Scholar
  6. [DM 89]
    M. Dietzfelbinger, F. Meyer auf der Heide: An optimal parallel dictionary, Proc. of ACM SPAA, pp. 360–368, 1989.Google Scholar
  7. [CW 77]
    J. L. Carter, M. N. Wegman, Universal classes of hash functions, Proc. of 9th ACM STOC, pp. 106–112, 1977.Google Scholar
  8. [WC 79]
    M. N. Wegman, J. L. Carter, New classes and applications of hash functions, 20th IEEE FOCS, pp. 175–182, 1979.Google Scholar
  9. [Sie 89]
    A. Siegel, On universal classes of fast high performance hash functions, their time-space trade-off, and their applications, Proc. of 30th IEEE FOCS, pp. 20–25, 1989.Google Scholar
  10. [KRS 90]
    C. P. Kruskal, M. Snir, L. Rudolph, A complexity theory of efficient parallel algorithms, Proc. of 15th ICALP pp. 333–346, 1988; also: revised preprint.Google Scholar
  11. [MV 84]
    K. Mehlhorn, U. Vishkin, Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memory, Acta Informatica 21, pp. 339–374, 1984.Google Scholar
  12. [U 84]
    E. Upfal, Efficient schemes for parallel communication, J. ACM 31(3), pp. 507–517, 1984.Google Scholar
  13. [R 87]
    A. G. Ranade, How to emulate shared memory, Proc. of 28 IEEE FOCS, pp. 185–194, 1987.Google Scholar
  14. [KU 86]
    A. Karlin, E. Upfal, Parallel hashing, an efficient implementation of shared memory, Proc. of 18th ACM STOC, pp. 160–168, 1986.Google Scholar
  15. [PVW]
    W. Paul, U. Vishkin, H. Wagener, Parallel dictionaries on 2–3 trees, Proc. of 10th ICALP, pp. 597–609, 1983.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Friedhelm Meyer auf der Heide
    • 1
  1. 1.Mathematik-Informatik Universität-GH PaderbornPaderbornFed. Rep. of Germany

Personalised recommendations