G. E. Andrews, The Theory of Partitions, 1976.
DOI : 10.1017/CBO9780511608650

L. Devroye, A Limit Theory for Random Skip Lists, The Annals of Applied Probability, vol.2, issue.3, pp.597-609, 1992.
DOI : 10.1214/aoap/1177005651

P. Flajolet, X. Gourdon, and P. Dumas, Mellin transforms and asymptotics: Harmonic sums, Theoretical Computer Science, vol.144, issue.1-2, pp.3-58, 1995.
DOI : 10.1016/0304-3975(95)00002-E
URL : https://hal.archives-ouvertes.fr/inria-00074307

P. Flajolet and G. N. Martin, Probabilistic counting algorithms for data base applications, Journal of Computer and System Sciences, vol.31, issue.2, pp.31-182, 1985.
DOI : 10.1016/0022-0000(85)90041-8
URL : https://hal.archives-ouvertes.fr/inria-00076244

P. Hitczenko and A. Knopfmacher, Gap-free compositions and gap-free samples of geometric random variables, Discrete Math, pp.225-239, 2005.

P. Hitczenko and G. Louchard, Distinctness of compositions of an integer: A probabilistic analysis, Random Structures and Algorithms, vol.35, issue.3-4, pp.407-437, 2001.
DOI : 10.1002/rsa.10008

P. Hitczenko and C. D. Savage, On the Multiplicity of Parts in a Random Composition of a Large Integer, SIAM Journal on Discrete Mathematics, vol.18, issue.2, pp.418-435, 2004.
DOI : 10.1137/S0895480199363155

P. Jacquet and W. Szpankowski, Analytical depoissonization and its applications, Theoretical Computer Science, vol.201, issue.1-2, pp.1-62, 1998.
DOI : 10.1016/S0304-3975(97)00167-9
URL : http://doi.org/10.1016/s0304-3975(97)00167-9

S. Janson and W. Szpankowski, Analysis of the asymmetric leader election algorithm, Electr. J. Combin, vol.4, p.17, 1997.

P. Kirschenhofer and H. Prodinger, On the analysis of probabilistic counting, Lecture Notes in Mathematics, vol.15, pp.1452-117, 1990.
DOI : 10.1137/0215054

G. Louchard and H. Prodinger, The number of gaps in sequences of geometrically distributed random variables, Discrete Math, pp.1538-1562, 2008.

H. Prodinger, Combinatorics of geometrically distributed random variables: Left-to-right maxima, Discrete Math, pp.253-270, 1996.
DOI : 10.1016/0012-365x(95)00141-i
URL : http://doi.org/10.1016/0012-365x(95)00141-i

W. Pugh, Skip lists: a probabilistic alternative to balanced trees, Communications of the ACM, vol.33, issue.6, pp.668-676, 1990.
DOI : 10.1145/78973.78977
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.6383

W. Szpankowski, Average Case Analysis of Algorithms on Sequences, 2001.
DOI : 10.1002/9781118032770