On the average-case complexity of “bucketing” algorithms
- 31 March 1982
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 3 (1), 9-13
- https://doi.org/10.1016/0196-6774(82)90003-7
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Average time behavior of distributive sorting algorithmsComputing, 1981
- Optimal Expected-Time Algorithms for Closest Point ProblemsACM Transactions on Mathematical Software, 1980
- Selection by distributive partitioningInformation Processing Letters, 1980
- The design and analysis of a new hybrid sorting algorithmInformation Processing Letters, 1980
- A note on Rabin's nearest-neighbor algorithmInformation Processing Letters, 1979
- Sorting by distributive partitioningInformation Processing Letters, 1978
- Finding nearest neighboursInformation Processing Letters, 1976