Adaptive Sampling for Quickselect

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 440-448

  Martinez, Conrado ^a   Panario, Daniel ^b   Viola, Alfredo ^c,d  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b CARLETON UNIVERSITY   (Canada)

^c Laboratoire d'Informatique de Paris Nord Villetaneuse   (France)

^d UNIVERSIDAD DE LA REPÚBLICA   (Uruguay)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; FUNCTIONS; INTEGRATION; MATHEMATICAL OPERATORS; RANDOM PROCESSES; SAMPLING; SORTING; THEOREM PROVING;

QUICKSELECT ALGORITHMS; QUICKSORT ALGORITHM;

ALGORITHMS;

EID: 1842592059     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. D. Anderson and R. Brown. Combinatorial aspects of C.A.R. Hoare's FIND algorithm. Australasian Journal of Combinatorics, 5:109-119, 1992.
2. R. Floyd and R. Rivest. Expected time bounds for selection. Communications of the ACM, 18(3): 165-173, 1975.
3. R. Grubel. On the median-of-k version of Hoare's selection algorithm. Theoretical Informatics and Applications, 33(2):177-192, 1999.
4. R. Grubel and U. Rosler. Asymptotic distribution theory for Hoare's selection algorithm. Adv. Appl. Prob., 28:252-269, 1996.
5. C. Hoare. FIND (Algorithm 65). Communications of the ACM, 4:321-322, 1961.
6. C. Hoare. Quicksort. Computer Journal, 5:10-15, 1962.
7. P. Kirschenhofer, H. Prodinger, and C. Martínez. Analysis of Hoare's FIND algorithm with median-of-three partition. Random Structures & Algorithms, 10(1):143-156, 1997.
8. D. Knuth. Mathematical analysis of algorithms. In Information Processing '71, Proc. of the 1971 IFIP Congress, pages 19-27, Amsterdam, 1972. North-Holland.
9. D. Knuth. The Art of Computer Programming: Sorting and Searching, volume 3. Addison-Wesley, Reading, Mass., 2nd edition, 1998.
10. H. Mahmoud. Sorting: A Distribution Theory. John Wiley & Sons, New York, 2000.
11. C. Martínez and S. Roura. Optimal sampling strategies in quicksort and quickselect. SIAM Journal on Computing, 31(3):683-705, 2001.
12. D. Musser. Introspective sorting and selection algorithms. Software-Practice and Experience, 27(8):983-993, 1997.
13. E. Rainville, P. Bedient, and R. Bedient. Elementary Differential Equations. Prentice Hall, 8th edition, 1997.