Efficient Ordering of Hash Tables
- 1 August 1979
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 8 (3), 463-478
- https://doi.org/10.1137/0208038
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- The Analysis of Hashing Techniques That Exhibit k -ary ClusteringJournal of the ACM, 1978
- Notes on the derivation of symptotic expressions from summationsInformation 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
- Reducing the retrieval time of scatter storage techniquesCommunications of the ACM, 1973
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Algorithm and Average-value Bounds for Assignment ProblemsIBM Journal of Research and Development, 1969
- On Approximation Methods for the Assignment ProblemJournal of the ACM, 1962
- Addressing for Random-Access StorageIBM Journal of Research and Development, 1957