An improved program for constructing open hash tables

  • Jeanette Schmidt
  • Eli Shamir
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 85)


Assignment Problem Hash Table Probe Position Table Size Full Table 
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.


  1. 1.
    Gonnet, G., and Munro, I. Efficient ordering of hash tables. SIAM S. Comput. 8, 3, 1979, pp. 463–478.Google Scholar
  2. 2.
    Brent, R.P. Reducing the retrieval time of scatter storage technique. Comm. ACM 16, 2, 1973, pp. 105–109.Google Scholar
  3. 3.
    Rivest, R.L. Optimal arrangement of keys in a hash table. JACM 25, 2, 1978, pp. 200–209.Google Scholar
  4. 4.
    Guibas, L.J., and Szemeredi, E. The analysis of double hashing. J. Comput. System Sci. 16, 1978, pp. 226–274.Google Scholar
  5. 5.
    Knuth, D.E. Mariage stable. Les presses de l'Universite de Montreal, Quebec, Canada, 1976.Google Scholar
  6. 6.
    Kolchin, V.F., Sevast'yanov, B.A., and Chistyakov, V.P. Random Allocations, V.H. Winston & Sons, Washington, D.C., 1978.Google Scholar
  7. 7.
    Ajtai, M., Komlos, J., and Szemeredi, E. There is no fast single hashing algorithm. Information Processing Letters 7, 6, 1978.Google Scholar
  8. 8.
    Donath, W.E. Algorithm and average-value bounds for assignment problems. IBM J. Res. Develo., 1969, pp. 380–386.Google Scholar
  9. 9.
    Tarjan, R.E. and Yau, A.C.C. Storing a sparse table. Comm. ACM 22, 11, 1979, pp. 606–611.Google Scholar
  10. 10.
    Walkup, D. On the expected value of a random assignment problem. SIAM J. Comput. 8, 3, 1979, pp. 440–442.Google Scholar
  11. 11.
    Feller, W. An Introduction to Probability Theory and its Application. Vol. 1, 2nd Ed., Wiley, New York, 1951.Google Scholar
  12. 12.
    Knuth, D.E. The Art of Computer Programming, Vol. III, Sorting and Searching. Addison-Wesley, Don Mills, 1973.Google Scholar
  13. 13.
    Gonnet, G.H. Interpolation and Interpolation Hash Searching. University of Waterloo, Computer Science Dept. Research Report 77-02.Google Scholar
  14. 14.
    Knuth, D.E. Computer science and its relation to mathematics. Am. Math. Monthly 8, 1974, pp. 323–343.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • Jeanette Schmidt
    • 1
  • Eli Shamir
    • 1
  1. 1.Department of Applied MathematicsThe Weizmann Institute of ScienceRehovotIsrael

Personalised recommendations