On the analysis of stochastic divide and conquer algorithms
- 1 February 2001
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 29 (1) , 238-261
- https://doi.org/10.1007/bf02679621
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- The moments of FINDJournal of Applied Probability, 1997
- Asymptotic distribution theory for Hoare's selection algorithmAdvances in Applied Probability, 1996
- Probability metrics and recursive algorithmsAdvances in Applied Probability, 1995
- Analytic analysis of algorithmsPublished by Springer Nature ,1992
- A limit theorem for “quicksort”RAIRO - Theoretical Informatics and Applications, 1991
- ErneuerungstheoriePublished by Springer Nature ,1991
- Combinatorial analysis of quicksort algorithmRAIRO - Theoretical Informatics and Applications, 1989
- Increasing the efficiency of quicksortCommunications of the ACM, 1970
- QuicksortThe Computer Journal, 1962
- Algorithm 64: QuicksortCommunications of the ACM, 1961