Strong concentration for quicksort

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129721, Issue , 1992, Pages 414-421

  McDiarmid, Colin ^a   Hayward, Ryan ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b QUEEN S UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

LARGE DEVIATIONS; QUICKSORT; RANDOM NUMBERS;

ALGORITHMS;

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

References (10)

1. L. Devroye. A note on the height of binary search trees. Journal of the ACM, 33(3):489-498, July 1986.
2. P. Hennequin. Combinatorial analysis of quicksort algorithm. Theoretical Informatics and Applications, 23(3):317-333, 1989.
3. C.A.R. Hoare. Partition (algorithm 63), quicksort (algorithm 64), and find (algorithm 65). J. ACM, 7:321-322, 1961.
4. C.A.R. Hoare. Quicksort. Computer J., 5:10-15, 1962.
5. Donald Knuth. The Art of Computer Programming. Addison-Wesley, first edition, 1973.
6. Colin McDiarmid. On the method of bounded differences. In J Siemons, editor, Surveys in Combinatorics. London Math Society, 1989.
7. Mireille Régnier. A limiting distribution for quicksort. Theoretical Informatics and Applications, 23(3):335-343, 1989.
8. Uwe Rosier. A limit theorem for quicksort, manuscript.
9. Robert Sedgewick. Quicksort. Garland Publishing Inc., first edition, 1980.
10. M. H. VanEmden. Increasing the efficiency of quicksort. Communications of the ACM, 13(9):563-567, September 1970.