C. Bender and S. Orszag, Advanced Mathematical Methods for Scientists and Engineers, 1978.
DOI : 10.1007/978-1-4757-3069-2

E. R. Canfield, From Recursions to Asymptotics: On Szekeres " Formula for the Number of Partitions, Electronic J. of Combinatorics, vol.4, p.6, 1997.

M. Cramer, A note concerning the limit distribution of the quicksort algorithm, Theoretical Informatics and Applications, pp.195-207, 1996.
DOI : 10.1051/ita/1996300301951

L. Devroye, A note on the height of binary search trees, Journal of the ACM, vol.33, issue.3, pp.489-498, 1986.
DOI : 10.1145/5925.5930

W. Eddy and M. Schervish, How Many Comparisons Does Quicksort Use?, Journal of Algorithms, vol.19, issue.3, pp.402-431, 1995.
DOI : 10.1006/jagm.1995.1044

P. Hennequin, Combinatorial analysis of quicksort algorithm, Theoretical Informatics and Applications, pp.317-333, 1989.
DOI : 10.1051/ita/1989230303171

P. Hennequin, Analyse en Moyenne d'Algorithmes, Tri Rapide at Arbres de Recherche, 1991.

P. Henrici, Applied and Computational Complex Analysis, 1977.

P. Jacquet and W. Szpankowski, Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees, Theoretical Computer Science, vol.144, issue.1-2, pp.161-197, 1995.
DOI : 10.1016/0304-3975(94)00298-W

C. Knessl and J. B. Keller, Partition Asymptotics from Recursion Equations, SIAM Journal on Applied Mathematics, vol.50, issue.2, pp.323-338, 1990.
DOI : 10.1137/0150020

D. Knuth, The Art of Computer Programming. Sorting and Searching, 1973.

C. J. Mcdiarmid and R. Hayward, Large Deviations for Quicksort, Journal of Algorithms, vol.21, issue.3, pp.476-507, 1996.
DOI : 10.1006/jagm.1996.0055

H. Mahmoud, Evolution of Random Search Trees, 1992.

S. Rachev and L. Rüschendorf, Probability metrics and recursive algorithms, Advances in Applied Probability, vol.II, issue.03, pp.770-799, 1995.
DOI : 10.1214/aop/1176992167

M. Régnier, A limiting distribution for quicksort, Theoretical Informatics and Applications, pp.335-343, 1989.
DOI : 10.1051/ita/1989230303351

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

U. Rösler, A Fixed Point Theorem for Distributions, Stochastic Processes and Their Applications, pp.195-214, 1992.

K. H. Tan and P. Hadjicostas, Some properties of a limiting distribution in Quicksort, Statistics & Probability Letters, vol.25, issue.1, pp.87-94, 1995.
DOI : 10.1016/0167-7152(94)00209-Q