Probabilistic analysis of MULTIPLE QUICK SELECT

Algorithmica (New York)

Volumn 22, Issue 4, 1998, Pages 569-584

  Mahmoud, H M ^a   Smythe, R T ^a  

^a GEORGE WASHINGTON UNIVERSITY   (United States)

Author keywords

Limit distribution; Sorting

Indexed keywords

EID: 0012821848     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009241     Document Type: Article

References (15)

1. Andrews, D., Bickel, P., Hampel, F., Huber, P., Rogers, W., and Tukey, J. (1972). Robust Estimates of Location: Surveys and Advances. Princeton University Press, Princeton, New Jersey.
2. Barbour, A., Holst, L., and Janson, S. (1992). Poisson Approximation. Oxford University Press, Oxford.
3. Chambers, J. (1971). Partial Sorting (Algorithm 410). Communications of the ACM, 14, 357-358.
4. Chung, K. (1974). A Course in Probability Theory. Academic Press, Orlando, Florida.
5. Hoare, C. (1962). Quicksort. Computer Journal, 5, 10-15.
6. Hoare, C. (1961). FIND (Algorithm 65). Communications of the ACM, 4, 321-322.
7. Hennequin, P. (1988). Combinatorial analysis of Quicksort algorithm. RAIRO: Theoretical Informatics and Applications, 23, 317-333.
8. Kirschenhofer, P., and Prodinger, H. (1998). Comparisons in Hoare's Find algorithm. Combinatorics, Probability, and Computing, 7, 111-120.
9. Knuth, D. (1973). The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley, Reading, Massachusetts.
10. Lent, J., and Mahmoud, H. (1996). Average-case analysis of multiple Quickselect: an algorithm for finding order statistics. Statistics and Probability Letters, 28, 299-310.
11. Mahmoud, H., Modarres, R., and Smythe, R. (1995). Analysis of quickselect: an algorithm for order statistics. RAIRO: Theoretical Informatics and Applications, 29, 255-276.
12. Panholzer, A., and Prodinger, H. (1998). A generating functions approach for the analysis of grand averages for Multiple Quickselect. Random Structures and Algorithms, to appear.
13. Prodinger, H. (1995). Multiple quickselect-Hoare's Find algorithm for several elements. Information Processing Letters, 56, 123-129.
14. Régnier, M. (1989). A limiting distribution of Quicksort. RAIRO: Theoretical Informatics and Applications, 23, 335-343.
15. Rösler, U. (1991). A limit theorem for "QUICKSORT." RAIRO: Theoretical Informatics and Applications, 25, 85-100.