On the median-of-k version of Hoare's selection algorithm

Theoretical Informatics and Applications

Volumn 33, Issue 2, 1999, Pages 177-192

  Grübel, Rudolf ^a  

^a LEIBNIZ UNIVERSITY HANNOVER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; PROBLEM SOLVING; RANDOM PROCESSES; SET THEORY;

DIVIDE-AND-CONQUER THEORY; HOARE SELECTION ALGORITHM;

ALGORITHMS;

EID: 0343826140     PISSN: 09883754     EISSN: None     Source Type: Journal    
DOI: 10.1051/ita:1999112     Document Type: Article

References (16)

1. D.H. Anderson and R. Brown, Combinatorial aspects of C.A.R. Hoare's FIND algorithm. Australasian J. Combinatorics 5 (1992) 109-119.
2. P. Bickel and D.A. Freedman, Some asymptotic theory for the bootstrap. Annals of Statistics 9 (1981) 1196-1217.
3. M. Blum, R.W. Floyd, V. Pratt, R.L. Rivest and R.E. Tarjan, Time bounds for selection. J. Comput. System Sci. 7 (1973) 448-461.
4. L. Devroye, Exponential bounds for the running time of a selection algorithm. J. Comput. System Sci. 29 (1984) 1-7.
5. N. Dunford and J.T. Schwartz, Linear Operators, Part I: General Theory. Wiley, New York (1958).
6. R.W. Floyd and R.L. Rivest, Expected time bounds for selection. Comm. ACM 18 (1975) 165-172.
7. R. Grübel and U. Rösler, Asymptotic distribution theory for Hoare's selection algorithm. Adv. in Applied Probab. 28 (1996) 252-269.
8. R. Grübel, Hoare's selection algorithm: A Markov chain approach. J. Appl. Probab. 35 (1998) 36-45.
9. C.A.R. Hoare, Algorithm 63: PARTITION, Algorithm 64: QUICKSORT, Algorithm 65: FIND. Comm. ACM 4 (1961) 321-322.
10. L. Hyafil, Bounds for selection. SIAM J. Comput. 5 (1976) 109-114.
11. D.E. Knuth, The Art of Computer Programming 3, Sorting and Searching. Addison-Wesley, Reading (1973).
12. B. Kodaj and T.F. Mori, On the number of comparisons in Hoare's algorithm "Find". Studia Sci. Math. Hungar. 33 (1997) 185-207.
13. J. Neveu, Mathematische Grundlagen der Wahrscheinlichkeitstheorie. Oldenbourg, München (1969).
14. V. Paulsen, The moments of FIND. J. Appl. Probab. 34 (1997) 1079-1082.
15. G.J.E. Rawlins, Compared to What? An Introduction to the Analysis of Algorithms. Freedman, New York (1992).
16. R. Sedgewick and P. Flajolet, An Introduction to the Analysis of Algorithms. Addison-Wesley, Reading (1996).