An improved program for constructing open hash tables
- 1 January 1980
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 569-581
- https://doi.org/10.1007/3-540-10003-2_99
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Storing a sparse tableCommunications of the ACM, 1979
- Efficient Ordering of Hash TablesSIAM Journal on Computing, 1979
- On the Expected Value of a Random Assignment ProblemSIAM Journal on Computing, 1979
- There is no fast single hashing algorithmInformation Processing Letters, 1978
- The analysis of double hashingJournal of Computer and System Sciences, 1978
- Optimal Arrangement of Keys in a Hash TableJournal of the ACM, 1978
- Computer Science and its Relation to MathematicsThe American Mathematical Monthly, 1974
- Reducing the retrieval time of scatter storage techniquesCommunications of the ACM, 1973
- Algorithm and Average-value Bounds for Assignment ProblemsIBM Journal of Research and Development, 1969