On the probablistic worst-case time of "Find"

Algorithmica (New York)

Volumn 31, Issue 3, 2001, Pages 291-303

  Devroye, L ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

Binary search tree; Expected time analysis; FIND; Order statistics; Selection problem

Indexed keywords

ALGORITHMS; PROBABILITY; PROBLEM SOLVING; STATISTICAL METHODS; THEOREM PROVING;

BINARY SEARCH TREES;

DATA STRUCTURES;

EID: 0242402043     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0046-2     Document Type: Article

References (29)

1. J. D. Biggins, The first- and last-birth problems for a multitype age-dependent branching process, Advances in Applied Probability, vol. 8, pp. 446-459, 1976.
2. J. D. Biggins, Chernoff's theorem in the branching random walk, Journal of Applied Probability, vol. 14, pp. 630-636, 1977.
3. M. Blum, R. W. Floyd, V. Pratt, R. L. Rivest, and R. E. Tarjan, Time bounds for selection, Journal of Computers and System Sciences, vol. 7, pp. 448-461, 1973.
4. L. Devroye, Exponential bounds for the running time of a selection algorithm, Journal of Computers and System Sciences, vol. 29, pp. 1-7, 1984.
5. L. Devroye, A note on the height of binary search trees, Journal of the ACM, vol. 33, pp. 489-498, 1986a.
6. L. Devroye, Non-Uniform Random Variate Generation, Springer-Verlag, New York, 1986b.
7. R. W. Floyd and R. L. Rivest, Expected time bounds for selection, Communications of the ACM, vol. 18, pp. 165-172, 1975.
8. R. Grübel and U. Rösler, Asymptotic distribution theory for Hoare's selection algorithm, Advances of Applied Probability, vol. 28, pp. 252-269, 1996.
9. J. M. Hammersley, Postulates for subadditive processes, Annals of Probability, vol. 2, pp. 652-680, 1974.
10. C. A. R. Hoare, Find (algorithm 65), Communications of the ACM, vol. 4, pp. 321-322, 1961.
11. J. F. C. Kingman, The first-birth problem for an age-dependent branching process, Annals of Probability, vol. 3, pp. 790-801, 1975.
12. P. Kirschenhofer and H. Prodinger, Comparisons in Hoare's Find algorithm. Combinatorics, Probability and Computing, vol. 7, pp. 111-120, 1998.
13. P. Kirschenhofer, H. Prodinger, and C. Martinez, Analysis of Hoare's Find algorithm with median-of-three partition. Random Structures and Algorithms, vol. 10, pp. 143-156, 1997.
14. D. E. Knuth, Mathematical analysis of algorithms, in: Information Processing 71, pp. 19-27 (Proceedings of IFIP Congress, Ljubljana, 1971), North-Holland, Amsterdam, 1972.
15. J. Lent and H. Mahmoud, Average-case analysis of multiple Quickselect: an algorithm for finding order statistics, Statistics and Probability Letters, vol. 28, pp. 299-310, 1996.
16. H. Mahmoud, R. Modarres, and R. Smythe, Analysis of Quickselect: an algorithm for order statistics, RAIRO: Theoretical Informatics and its Applications, vol. 29, pp. 255-276, 1995.
17. H. Mahmoud and R. Smythe, Probabilistic analysis of Multiple Quickselect, Algorithmica, vol. 22, pp. 569-584, 1998.
18. R. Neininger, Limit laws for partial match queries in k-d trees, Asymptotic distributions for partial match queries in K-d trees, Random Structures and Algorithms, vol. 17, pp.0-0, 2000.
19. R. Neininger and L. Rüschendorf, On the internal path length in quadtrees, Random Structures and Algorithms, vol. 15, pp. 25-41, 1999a.
20. R. Neininger and L. Rüschendorf, Limit laws for partial match queries in quadtrees. Technical Report 32-1999, University of Freiburg, 1999b.
21. A. Panholzer and H. Prodinger, A generating functions approach for the analysis of grand averages for Multiple Quickselect, Random Structures and Algorithms, vol. 13, pp. 189-209, 1998.
22. H. Prodinger, Multiple Quickselect - Hoare's Find algorithm for several elements, Information Processing Letters, vol. 56, pp. 123-129, 1995.
23. U. Rösler, A limit theorem for quicksort, Theoretical Informatics and Applications, vol. 25, pp. 85-100, 1991.
24. U. Rösler, A fixed point theorem for distributions, Stochastic Processes and their Applications, vol. 42, pp. 195-214, 1992.
25. U. Rösler, The backward view on the algorithm FIND, Technical Report, Fachbereich Stochastik, Universität Kiel, 1997.
26. U. Rösler and L. Rüschendorf, The contraction method for recursive algorithms, Technical Report, University of Kiel, 1999.
27. A. Schönhage, M. Paterson, and N. Pippenger, Finding the median, Journal of Computers and System Sciences, vol. 13, pp. 184-199, 1976.
28. J. M. Stoyanov, Counterexamples in Probability, Wiley, Chichester, 1987.
29. A. J. Walker, An efficient method for generating discrete random variables with general distributions, ACM Transactions on Mathematical Software, vol. 3, pp. 253-256, 1977.