1. The contraction method for recursive algorithms
2. [19] Hennequin P. (1991). Analyse en moyenne d'algorithme, tri rapide et arbres de recherche. Doctoral Thesis, École Polytechnique, Palaiseau.
3. Approximating the limiting Quicksort distribution
4. [31] Neininger R. and Rüschendorf L. (2001). A general contraction theorem and asymptotic normality in combinatorial structures. Preprint. Available at http://neyman.mathematik.uni-freiburg.de/homepages/neininger/. Tech. Rep. 01-28, Mathematische Fakultät, Universität Freiburg.
5. On a multivariate contraction method for random recursive structures with applications to Quicksort