This is a preview of subscription content, log in via an institution to check access.
References
Ole Amble and Donald E. Knuth,Ordered hash tables, Computer Journal, Vol. 17, No. 2. pp. 135; 142, May 1974. Also Computer Science Dept. Report STAN-CS-73-367, Stanford Univ., June 1973.
Richard P. Brent,Reducing the retrieval time of scatter storage techniques, CACM, Vol. 16, No. 2, pp. 105–109, February 1998
Gary D. Knott,Hashing functions, Computer Journal, Vol. 18, No. 3, pp. 265–278, Aug. 1975.
Gary D. Knott,Direct-chaining with coalescing lists, J. Algorithms, Vol. 4, No. 1, pp. 3–27, Dec. 1984.
Donald E. Knuth,The Art of Computer Programming, Vol. 3:Searching and Sorting, Addison-Wesley, Reading, Mass., 1973.
Donald E. Knuth,Computer science and its relation to mathematics, Amer. Math. Monthly, Vol. 81, No. 4, pp. 323–343, April 1974.
Alan G. Konheim and Benjamin Weiss,An occupancy discipline and applications, SIAM J. of Applied Mathematics, Vol. 14, No. 6, pp. 1266–1274, November 1966.
J. Kral,Some properties of the scatter storage technique with linear probing, Computer Journal, Vol. 14, No. 2, pp. 145–149, May 1971.
W. Wesley Peterson,Addressing for Random Access Storage, IBM J. of Research and Development, Vol. 1, No. 2, pp. 130–146, April 1957.
Ronald L. Rivest,Optimal Arrangement of Keys in a Hash Table, JACM, Vol. 25, No. 2, pp. 200–209, April 1978, also M.I.T. Lab for Computer Science Report MIT/LCS/TM-73, July 1976.
Jeffrey D. Ullman,A note on the efficiency of hashing functions, JACM, Vol. 19, No. 3, pp. 569–575, July 1972, alsoThe design of hashing functions, EE Dept. Tech. Report, No. 85, Princeton University, 1970. This work is also discussed in [5].
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Knott, G.D. Linear open addressing and Peterson's theorem rehashed. BIT 28, 364–371 (1988). https://doi.org/10.1007/BF01934101
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01934101