On the median-of-k version of Hoare’s selection algorithm
Grübel, Rudolf
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 33 (1999), p. 177-192 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU) 
@article{ITA_1999__33_2_177_0,
     author = {Gr\"ubel, Rudolf},
     title = {On the median-of-$k$ version of Hoare's selection algorithm},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {33},
     year = {1999},
     pages = {177-192},
     mrnumber = {1707969},
     zbl = {0946.68058},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_1999__33_2_177_0}
}

Grübel, Rudolf. On the median-of-$k$ version of Hoare’s selection algorithm. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 33 (1999) pp. 177-192. http://gdmltest.u-ga.fr/item/ITA_1999__33_2_177_0/

[1] D. H. Anderson and R. Brown, Combinatorial aspects of C.A.R. Hoare's FIND algorithm. Australasian J. Combinatorics 5 (1992) 109-119. | MR 1165798 | Zbl 0752.68021

[2] P. Bickel and D. A. Freedman, Some asymptotic theory for the bootstrap. Annals of Statistics 9 (1981) 1196-1217. | MR 630103 | Zbl 0449.62034

[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. | MR 329916 | Zbl 0278.68033

[4] L. Devroye, Exponential bounds for the running time of a selection algorithm. J. Comput. System Sci. 29 (1984) 1-7. | MR 761047 | Zbl 0555.68018

[5] N. Dunford and J. T. Schwartz, Linear Operators, Part I: General Theory. Wiley, New York (1958). | MR 1009162 | Zbl 0084.10402

[6] R. W. Floyd and R. L. Rivest, Expected time bounds for selection. Comm. ACM 18 (1975) 165-172. | Zbl 0296.68049

[7] R. Grübel and U. Rösler, Asymptotic distribution theory for Hoare's selection algorithm. Adv. in Applied Probab. 28 (1996) 252-269. | MR 1372338 | Zbl 0853.60033

[8] R. Grübel, Hoare's selection algorithm: A Markov chain approach. J. Appl. Probab. 35 (1998) 36-45. | MR 1622443 | Zbl 0913.60059

[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. | MR 398164 | Zbl 0324.68028

[11] D. E. Knuth, The Art of Computer Programming 3, Sorting and Searching. Addison-Wesley, Reading (1973). | MR 378456

[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. | MR 1454110 | Zbl 0910.60002

[13] J. Neveu, Mathematische Grundlagen der Wahrscheinlichkeitstheorie. Oldenbourg, München (1969). | MR 245056 | Zbl 0174.21201

[14] V. Paulsen, The moments of FIND. J. Appl. Probab. 34 (1997) 1079-1082. | MR 1484039 | Zbl 0892.60100

[15] G. J. E. Rawlins, Compared to What ? An Introduction to the Analysis of Algorithms. Freedman, New York (1992). | Zbl 0824.68044

[16] R. Sedgewick and P. Flajolet, An Introduction to the Analysis of Algorithms. Addison-Wesley, Reading (1996). | Zbl 0841.68059