A. Khan, T. Neininger, and R. , Probabilistic analysis for randomized game tree evaluation. em Mathematics and computer science. III, pp.163-174, 2004.

M. G. Blum, O. François, and S. Janson, The mean, variance and limiting distribution of two statistics sensitive to phylogenetic tree balance, The Annals of Applied Probability, vol.16, issue.4, 2005.
DOI : 10.1214/105051606000000547

P. Bougerol and N. Picard, Strict Stationarity of Generalized Autoregressive Processes, The Annals of Probability, vol.20, issue.4, pp.1714-1730, 1992.
DOI : 10.1214/aop/1176989526

A. Brandt, The Stochastic Equation Y n+1 = A n Y n +B n with Stationary Coefficients, Advances in Applied Probability, vol.18, issue.1, pp.211-220, 1986.
DOI : 10.2307/1427243

V. Bruhn, Eine Methode zur asymptotischen Behandlung einer Klasse von Rekursionsgleichungen mit einer Anwendung in der stochastischen Analyse des Quicksort-Algorithmus, 1996.

R. Burton and U. Rösler, An L 2 convergence theorem for random affine mappings, Journal of Applied Probability, vol.11, issue.01, pp.183-192, 1995.
DOI : 10.1214/aop/1176996798

H. Chern and H. Hwang, Transitional behaviors of the average cost of quicksort with median-of-(2t + 1), Algorithmica, vol.19, issue.1-2, pp.44-69, 2001.
DOI : 10.1007/BF02679613

M. Cramer and L. Rüschendorf, Convergence of a branching type recursion, Ann. Inst. H. Poincaré Probab. Statist, vol.32, pp.725-741, 1996.

M. Cramer and L. Rüschendorf, Convergence of two-dimensional branching recursions, Journal of Computational and Applied Mathematics, vol.130, issue.1-2, pp.53-73, 2001.
DOI : 10.1016/S0377-0427(99)00391-X

P. Diaconis and D. Freedman, Iterated Random Functions, SIAM Review, vol.41, issue.1, pp.45-76, 1999.
DOI : 10.1137/S0036144598338446

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

R. Durrett and T. M. Liggett, Fixed points of the smoothing transformation, Zeitschrift f??r Wahrscheinlichkeitstheorie und Verwandte Gebiete, vol.39, issue.3, pp.275-301, 1983.
DOI : 10.1007/BF00532962

H. Furstenberg and H. Kesten, Products of Random Matrices, The Annals of Mathematical Statistics, vol.31, issue.2, pp.457-469, 1960.
DOI : 10.1214/aoms/1177705909

C. M. Goldie and R. A. Maller, Stability of perpetuities, Ann. Probab, vol.28, pp.1195-1218, 2000.

D. H. Green, Labelled Formal Languages and their Uses, 1983.

Y. Guivarc-'h, Sur une extension de la notion de loi semi-stable, Ann. Inst. H. Poincaré Probab. Statist, vol.26, pp.261-286, 1996.

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

P. Hennequin, Analyse en moyenne d'algorithme, tri rapide et arbres de recherche, 1991.

R. Holley and T. M. Liggett, Generalized potlatch and smoothing processes, Zeitschrift f???r Wahrscheinlichkeitstheorie und Verwandte Gebiete, vol.22, issue.2, pp.165-195, 1981.
DOI : 10.1007/BF00535158

H. Hwang and R. Neininger, Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions, SIAM Journal on Computing, vol.31, issue.6, pp.1687-1722, 2002.
DOI : 10.1137/S009753970138390X

H. Hwang and T. Tsai, Quickselect and the Dickman Function, Combinatorics, Probability and Computing, vol.11, issue.04, pp.353-371, 2002.
DOI : 10.1017/S0963548302005138

J. Kahane and J. Andpeyrì-ere, Sur certaines martingales de Benoit Mandelbrot, Advances in Mathematics, vol.22, issue.2, pp.131-145, 1976.
DOI : 10.1016/0001-8708(76)90151-1

H. Kesten, Random difference equations and Renewal theory for products of random matrices, Acta Mathematica, vol.131, issue.0, pp.207-248, 1973.
DOI : 10.1007/BF02392040

J. F. Kingman, Subadditive Ergodic Theory, The Annals of Probability, vol.1, issue.6, pp.883-909, 1973.
DOI : 10.1214/aop/1176996798

D. E. Knuth, The art of computer programming: Fundamental Algorithms, 1997.

D. E. Knuth, The art of computer programming, Seminumerical Algorithms, 1997.

D. E. Knuth, The art of computer programming: sorting and searching, 1998.

H. M. Mahmoud, Evolution of random search trees. Wiley-Interscience Series in Discrete Mathematics and Optimization, 1992.

H. M. Mahmoud, The joint distribution of the three types of nodes in uniform binary trees, Algorithmica, vol.11, issue.3, pp.313-323, 1995.
DOI : 10.1007/BF01190510

H. M. Mahmoud, Sorting. A Distribution Theory, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00073290

H. M. Mahmoud, R. Modarres, and R. T. Smythe, Analysis of quickselect : an algorithm for order statistics, RAIRO - Theoretical Informatics and Applications, vol.29, issue.4, pp.255-276, 1995.
DOI : 10.1051/ita/1995290402551

H. M. Mahmoud and R. T. Smythe, On the Distribution of Leaves in Rooted Subtrees of Recursive Trees, The Annals of Applied Probability, vol.1, issue.3, pp.406-418, 1991.
DOI : 10.1214/aoap/1177005874

H. M. Mahmoud and R. T. Smythe, Asymptotic Joint Normality of Outdegrees of Nodes in Random Recursive Trees, Random Structures and Algorithms, vol.19, issue.3, pp.255-266, 1992.
DOI : 10.1002/rsa.3240030305

H. M. Mahmoud, R. T. Smythe, and J. Szyma´nskiszyma´nski, On the structure of random plane-oriented recursive trees and their branches, Random Structures and Algorithms, vol.74, issue.2, pp.151-176, 1993.
DOI : 10.1002/rsa.3240040204

B. Mandelbrot, Multiplications aléatoires itérées et distributions invariantes par moyenne pondérée aléatoire, C. R. Acad. Sci, vol.278, pp.289-292, 1974.

R. Neininger, Limit Laws for random recursive structures and algorithms, 1999.

R. Neininger, On a multivariate contraction method for random recursive structures with applications to Quicksort, Random Structures and Algorithms, vol.25, issue.3-4, pp.498-524, 2001.
DOI : 10.1002/rsa.10010

R. Neininger, The Wiener Index of Random Trees, Combinatorics, Probability and Computing, vol.11, issue.06, pp.587-597, 2002.
DOI : 10.1017/S0963548302005321
URL : https://hal.archives-ouvertes.fr/hal-01184772

R. Neininger and L. Rüschendorf, On the internal path length ofd-dimensional quad trees, Random Structures and Algorithms, vol.42, issue.1, pp.25-41, 1999.
DOI : 10.1002/(SICI)1098-2418(199908)15:1<25::AID-RSA2>3.0.CO;2-R

R. Neininger and L. Rüschendorf, A general limit theorem for recursive algorithms and combinatorial structures, Ann. Appl. Probab, vol.14, pp.378-418, 2004.

R. Neininger and L. Rüschendorf, On the contraction method with degenerate limit equation, Ann. Probab, vol.32, pp.2838-2856, 2004.

S. T. Rachev, Probability Metrics and the Stability of Stochastic Models, 1991.

S. T. 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, RAIRO - Theoretical Informatics and Applications, vol.23, issue.3, pp.335-343, 1989.
DOI : 10.1051/ita/1989230303351

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

U. Rösler, A fixed point theorem for distributions. Stochastic Process, Appl, vol.42, pp.195-214, 1992.

U. Rösler, A fixed point equation for distributions, Berichtsreihe des Mathematischen Seminars Kiel, pp.98-105, 1998.

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

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

R. Sedgewick, The analysis of Quicksort programs, Acta Informatica, vol.13, issue.4, pp.327-355, 1977.
DOI : 10.1007/BF00289467

W. Vervaat, On a stochastic difference equation and a representation of non-negative infinitly divisible, Adv. in Appl. Probab, vol.11, pp.750-783, 1979.

V. M. Zolotarev, Approximation of Distributions of Sums of Independent Random Variables with Values in Infinite-Dimensional Spaces, Theory of Probability & Its Applications, vol.21, issue.4, pp.721-737, 1976.
DOI : 10.1137/1121086