The expected length of the longest probe sequence for bucket searching when the distribution is not uniform
- 31 March 1985
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 6 (1) , 1-9
- https://doi.org/10.1016/0196-6774(85)90015-x
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Expected Worst-case Performance of Hash FilesThe Computer Journal, 1982
- On the average-case complexity of “bucketing” algorithmsJournal of Algorithms, 1982
- Expected Length of the Longest Probe Sequence in Hash Code SearchingJournal of the ACM, 1981
- Searching and sorting real numbersJournal of Algorithms, 1981
- Average time behavior of distributive sorting algorithmsComputing, 1981
- On the average complexity of some bucketing algorithmsComputers & Mathematics with Applications, 1981
- The design and analysis of a new hybrid sorting algorithmInformation Processing Letters, 1980
- Sorting by distributive partitioningInformation Processing Letters, 1978
- A Useful Convergence Theorem for Probability DistributionsThe Annals of Mathematical Statistics, 1947