Asymptotic distribution theory for Hoare's selection algorithm

Advances in Applied Probability

Volumn 28, Issue 1, 1996, Pages 252-269

  Grübel, Rudolf ^a,b   Rösler, Uwe ^a,b  

^a LEIBNIZ UNIVERSITY HANNOVER   (Germany)

^b UNIVERSITY OF KIEL   (Germany)

Author keywords

Asymptotic distribution; Order statistics; Random binary numbers; Random walk in a random environment; Stochastic algorithms

Indexed keywords

EID: 0000267981     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1017/S000186780002735X     Document Type: Article

References (12)

1. ATHREYA, K. B. AND NEY, P. E. (1972) Branching Processes. Springer, Berlin.
2. BICKEL, P. AND FREEDMAN, D. A. (1981) Some asymptotic theory for the bootstrap. Ann. Statist. 9, 1196-1217.
3. BILLINGSLEY, P. (1968) Convergence of Probability Measures. Wiley, New York.
4. DEVROYE, L. (1984) Exponential bounds for the running time of a selection algorithm. J. Comput. Syst. Sci. 29, 1-7.
5. HOARE, C. A. R. (1961) Algorithm 63, Partition; Algorithm 64, Quicksort; Algorithm 65, Find. Commun. ACM 4, 321-322.
6. HOARE, C. A. R. (1962) Quicksort. Comput. J. 5, 10-15.
7. JOHNSON, N. L. AND KOTZ, S. (1970) Continuous Univariate Distributions - 1. Houghton Mifflin, Boston.
8. KNLTH, D. E. (1973) The Art of Computer Programming. Vol. 3: Sorting and Searching. AddisonWesley, Reading.
9. RACHEV, S. T. AND RÜSCHENDORF, L. (1995) Probability metrics and recursive algorithms. Adv. Appl. Prob. 27, 770-799.
10. RÖSLER, U. (1991) A limit theorem for 'Quicksort'. Theor. Inf. Appl. 25, 85-100.
11. RÖSLER, U. (1992) A fixed point theorem for distributions. Stoch. Proc. Appl. 42, 195-214.
12. SEDGEWICK, R. (1990) Algorithms in C. Addison-Wesley, New York.