Skip to main content
SpringerLink
Log in

An improved program for constructing open hash tables

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1980)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 85))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gonnet, G., and Munro, I. Efficient ordering of hash tables. SIAM S. Comput. 8, 3, 1979, pp. 463–478.

    Google Scholar 

  2. Brent, R.P. Reducing the retrieval time of scatter storage technique. Comm. ACM 16, 2, 1973, pp. 105–109.

    Google Scholar 

  3. Rivest, R.L. Optimal arrangement of keys in a hash table. JACM 25, 2, 1978, pp. 200–209.

    Google Scholar 

  4. Guibas, L.J., and Szemeredi, E. The analysis of double hashing. J. Comput. System Sci. 16, 1978, pp. 226–274.

    Google Scholar 

  5. Knuth, D.E. Mariage stable. Les presses de l'Universite de Montreal, Quebec, Canada, 1976.

    Google Scholar 

  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. Ajtai, M., Komlos, J., and Szemeredi, E. There is no fast single hashing algorithm. Information Processing Letters 7, 6, 1978.

    Google Scholar 

  8. Donath, W.E. Algorithm and average-value bounds for assignment problems. IBM J. Res. Develo., 1969, pp. 380–386.

    Google Scholar 

  9. Tarjan, R.E. and Yau, A.C.C. Storing a sparse table. Comm. ACM 22, 11, 1979, pp. 606–611.

    Google Scholar 

  10. Walkup, D. On the expected value of a random assignment problem. SIAM J. Comput. 8, 3, 1979, pp. 440–442.

    Google Scholar 

  11. Feller, W. An Introduction to Probability Theory and its Application. Vol. 1, 2nd Ed., Wiley, New York, 1951.

    Google Scholar 

  12. Knuth, D.E. The Art of Computer Programming, Vol. III, Sorting and Searching. Addison-Wesley, Don Mills, 1973.

    Google Scholar 

  13. Gonnet, G.H. Interpolation and Interpolation Hash Searching. University of Waterloo, Computer Science Dept. Research Report 77-02.

    Google Scholar 

  14. Knuth, D.E. Computer science and its relation to mathematics. Am. Math. Monthly 8, 1974, pp. 323–343.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, The Weizmann Institute of Science, Rehovot, Israel

    Jeanette Schmidt & Eli Shamir

Authors
  1. Jeanette Schmidt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eli Shamir
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jaco de Bakker Jan van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schmidt, J., Shamir, E. (1980). An improved program for constructing open hash tables. In: de Bakker, J., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 1980. Lecture Notes in Computer Science, vol 85. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10003-2_99

Download citation

  • DOI: https://doi.org/10.1007/3-540-10003-2_99

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10003-4

  • Online ISBN: 978-3-540-39346-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation