P. Billingsley, Convergence of Probability Measures, Wiley Series in Probability and Statistics, 1968.
DOI : 10.1002/9780470316962

R. Grübel and U. Rösler, Asymptotic distribution theory for Hoare's selection algorithm, Advances in Applied Probability, vol.25, issue.01, pp.252-269, 1996.
DOI : 10.1016/0022-0000(84)90009-6

A. R. Charles and . Hoare, PARTITION (Algorithm 63);QUICKSORT (Algorithm 64);FIND (Algorithm 65, pp.321-322, 1961.

D. Knof and U. Roesler, The analysis of find or perpetuities on cadlag functions

C. Martínez, Partial quicksort. Alcom-FT Technical Report Series, ALCOM-FT-RR-03-50, 2004.

C. Martínez, D. Panario, and A. Viola, Adaptive sampling strategies for quickselects, ACM Transactions on Algorithms, vol.6, issue.3, 2008.
DOI : 10.1145/1798596.1798606

C. Martínez and S. Roura, Optimal Sampling Strategies in Quicksort and Quickselect, SIAM Journal on Computing, vol.31, issue.3, pp.683-705, 2001.
DOI : 10.1137/S0097539700382108

U. Roesler, A limit theorem for ???quicksort???, Theoretical Informatics and Applications, pp.85-100, 1991.
DOI : 10.1051/ita/1991250100851

U. Roesler, A fixed point theorem for distributions, Stochastic Processes and their Applications, pp.195-214, 1992.
DOI : 10.1016/0304-4149(92)90035-O

U. Roesler, Dynamics of complex and irregular systems, Bielefeld Encount. Math. Phys. VIII World Sci. Publishing, pp.154-165, 1991.

U. Roesler, On the analysis of stochastic divide and conquer algorithms, Algorithmica, vol.7, issue.1-2, pp.238-261, 2001.
DOI : 10.1007/BF02679621

U. Roesler and L. Rüschendorf, The contraction method for recursive algorithms, Algorithmica, vol.25, issue.2, pp.3-33, 2001.
DOI : 10.1007/BF02679611