R. Arratia, A. D. Barbour, and S. Tavaré, Logarithmic Combinatorial Structures: A Probabilistic Approach, EMS Monographs in Mathematics. European Mathematical Society, 2003.
DOI : 10.4171/000

N. Bingham and R. Doney, Asymptotic properties of supercritical branching processes I: The Galton-Watson process, Advances in Applied Probability, vol.47, issue.04, pp.711-731, 1974.
DOI : 10.1214/aoms/1177699266

N. Bingham, C. M. Goldie, and J. L. Teugels, Regular Variation. Encyclopedia of Mathematics and Its Applications, 1987.
DOI : 10.1017/cbo9780511721434

S. Boucheron, G. Lugosi, and P. Massart, A sharp concentration inequality with applications. Random Structures Algorithms, pp.277-292, 2000.

S. Boucheron, G. Lugosi, and P. Massart, Concentration inequalities using the entropy method, Annals of Probability, vol.31, issue.3, pp.1583-1614, 2003.

N. Broutin and L. Devroye, Large Deviations for the Weighted Height of an Extended Class of Trees, Algorithmica, vol.46, issue.3-4, pp.271-297, 2006.
DOI : 10.1007/s00453-006-0112-x

R. Davis and S. Resnick, Limit theory for bilinear processes with heavy-tailed noise, The Annals of Applied Probability, vol.6, issue.4, pp.1191-1210, 1996.
DOI : 10.1214/aoap/1035463328

L. Devroye, Laws of large numbers and tail inequalities for random tries and PATRICIA trees, Journal of Computational and Applied Mathematics, vol.142, issue.1, pp.27-37, 2002.
DOI : 10.1016/S0377-0427(01)00458-7

P. Embrechts and C. M. Goldie, Perpetuities and Random Equations, Asymptotic Statistics: Proceedings of the Fifth Prague Symposium, Physica, pp.75-86, 1994.
DOI : 10.1007/978-3-642-57984-4_6

W. Feller, An Introduction to Probability Theory and Applications II. Second Edition, Wiley Series in Probability and Mathematical Statistic, 1971.

C. M. Goldie, Implicit Renewal Theory and Tails of Solutions of Random Equations, The Annals of Applied Probability, vol.1, issue.1, pp.126-166, 1991.
DOI : 10.1214/aoap/1177005985

C. M. Goldie and R. Grübel, Perpetuities with thin tails, Advances in Applied Probability, vol.1, issue.02, pp.463-480, 1996.
DOI : 10.2307/1426858

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.4100

C. M. Goldie and R. A. Maller, Stability of perpetuities, Annals of Probability, vol.28, issue.3, pp.1195-1218, 2000.

M. J. Goovaerts, R. Kaas, R. J. Laeven, Q. Tang, and R. Vernic, The tail probability of discounted sums of Pareto-like losses in insurance, Scandinavian Actuarial Journal, vol.6, pp.446-461, 2005.

D. Grey, Regular Variation in the Tail Behaviour of Solutions of Random Difference Equations, The Annals of Applied Probability, vol.4, issue.1, pp.169-183, 1994.
DOI : 10.1214/aoap/1177005205

A. Grincevi?ius, One limit distribution for a random walk on the line, Lithuanian Mathematical Journal, vol.19, issue.No. 1, pp.580-589, 1975.
DOI : 10.1007/BF00969789

A. Iksanov, Elementary fixed points of the BRW smoothing transforms with finite number of summands, Stochastic Processes and Their Applications, pp.27-50, 2004.

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

Q. Liu, Fixed points of a generalized smoothing transformation and applications to the branching random walk, Advances in Applied Probability, vol.84, issue.01, pp.85-112, 1998.
DOI : 10.1090/S0002-9947-1986-0831202-5

H. M. Mahmoud, Evolution of Random Search Trees Wiley-Interscience Series in Discrete Mathematics and Optimization, 1992.

C. Mcdiarmid, Concentration, Probabilistic Methods for Algorithmic Discrete Mathematics, pp.195-248, 1998.
DOI : 10.1007/978-3-662-12788-9_6

R. Motwani and P. Raghavan, Randomized Algorithms, 1995.

R. Neininger and L. Rüschendorf, A general limit theorem for recursive algorithms and combinatorial structures, Annals of Applied Probability, vol.14, issue.1, pp.378-418, 2004.

L. Rüschendorf and E. Schopp, Exponential bounds and tails for additive random recursive sequences, DMTCS, vol.9, issue.1, pp.333-352, 2007.

L. Rüschendorf and E. Schopp, Exponential tail bounds for max-recursive sequences, Electronic Communications in Probability, vol.11, issue.0, pp.266-277, 2006.
DOI : 10.1214/ECP.v11-1227

R. Sedgewick and P. Flajolet, An Introduction to the Analysis of Algorithms, 1996.

W. Szpankowski, Average Case Analysis of Algorithms on Sequences Wiley-Interscience Series in Discrete Mathematics and Optimization, 2001.