F. Bassino, J. Clément, and C. Nicaud, The standard factorization of Lyndon words: an average point of view, Discrete Mathematics, vol.290, issue.1, pp.1-25, 2005.
DOI : 10.1016/j.disc.2004.11.002
URL : https://hal.archives-ouvertes.fr/hal-00619337

E. A. Bender and Z. Gao, Part Sizes of Smooth Supercritical Compositional Structures, Combinatorics, Probability and Computing, vol.16, issue.05, pp.686-716, 2014.
DOI : 10.1016/j.jcta.2010.11.014

R. Carr, W. M. Goh, and E. Schmutz, The maximum degree in a random tree and related problems, Proceedings of the Fifth International Seminar on Random Graphs and Probabilistic Methods in Combinatorics and Computer Science (Pozna´nPozna´n, pp.13-24, 1991.
DOI : 10.1002/rsa.3240050104

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 R. Sedgewick, Analytic combinatorics, 2009.
DOI : 10.1017/CBO9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

A. Gafni, Longest run of equal parts in a random integer composition, Discrete Mathematics, vol.338, issue.2, pp.236-247, 2015.
DOI : 10.1016/j.disc.2014.10.003

Z. Gao and N. C. Wormald, The Distribution of the Maximum Vertex Degree in Random Planar Maps, Journal of Combinatorial Theory, Series A, vol.89, issue.2, pp.201-230, 2000.
DOI : 10.1006/jcta.1999.3006

X. Gourdon, Largest component in random combinatorial structures, Proceedings of the 7th Conference on Formal Power Series and Algebraic Combinatorics, pp.185-209, 1995.
DOI : 10.1016/S0012-365X(97)00115-5
URL : https://hal.archives-ouvertes.fr/inria-00074131

P. J. Grabner, A. Knopfmacher, and H. Prodinger, Combinatorics of geometrically distributed random variables: run statistics, Theoretical Computer Science, vol.297, issue.1-3, pp.261-270, 2000.
DOI : 10.1016/S0304-3975(02)00641-2

D. H. Greene and D. E. Knuth, Mathematics for the analysis of algorithms, volume 1 of Progress in Computer Science and Applied Logic, Birkhäuser Boston Inc, 1990.

L. J. Guibas and A. M. Odlyzko, Long repetitive patterns in random sequences, Zeitschrift f???r Wahrscheinlichkeitstheorie und Verwandte Gebiete, vol.11, issue.3, pp.241-262, 1980.
DOI : 10.1007/BF00531434

F. Harary and E. M. Palmer, Graphical enumeration, 1973.
DOI : 10.1007/bfb0066432

F. Harary and G. Prins, The number of homeomorphically irreducible trees, and other species, Acta Mathematica, vol.101, issue.1-2, pp.141-162, 1959.
DOI : 10.1007/BF02559543

C. Heuberger and H. Prodinger, Carry propagation in signed digit representations, European Journal of Combinatorics, vol.24, issue.3, pp.293-320, 2003.
DOI : 10.1016/S0195-6698(03)00008-8

H. Hwang and Y. Yeh, Measures of Distinctness for Random Partitions and Compositions of an Integer, Advances in Applied Mathematics, vol.19, issue.3, pp.378-414, 1997.
DOI : 10.1006/aama.1997.0555

A. Knopfmacher and H. Prodinger, On Carlitz Compositions, European Journal of Combinatorics, vol.19, issue.5, pp.579-589, 1998.
DOI : 10.1006/eujc.1998.0216

D. E. Knuth, The average time for carry propagation, Nederl. Akad. Wetensch. Indag. Math, vol.40, issue.2, pp.238-242, 1978.

G. Louchard and H. Prodinger, Asymptotics of the Moments of Extreme-Value Related Distribution Functions, Algorithmica, vol.46, issue.3-4, pp.431-467, 2006.
DOI : 10.1007/s00453-006-0106-8

K. Manes, A. Sapounakis, I. Tasoulas, and P. Tsikouras, Nonleft peaks in Dyck paths: A combinatorial approach, Discrete Mathematics, vol.337, pp.97-105, 2014.
DOI : 10.1016/j.disc.2014.07.015

T. Mansour, Statistics on Dyck paths, Journal of Integer Sequences, vol.9, 2006.

A. Meir and J. W. Moon, On the maximum out-degree in random trees, Australas. J. Combin. Combinatorial mathematics and combinatorial computing, vol.2, issue.2, pp.147-156, 1989.

H. Niederhausen and S. Sullivan, Pattern avoiding ballot paths and finite operator calculus, Journal of Statistical Planning and Inference, vol.140, issue.8, pp.2312-2320, 2010.
DOI : 10.1016/j.jspi.2010.01.026
URL : http://arxiv.org/abs/0709.0878

A. Odlyzko and B. Richmond, On the compositions of an integer, Combinatorial mathematics, VII (Proc. Seventh Australian Conf, pp.199-210, 1979.
DOI : 10.1007/BF01836532

H. Prodinger, ??ber L??ngste 1-Teilfolgen In 0-1-Folgen, Lecture Notes in Mathematics, vol.40, pp.124-133, 1987.
DOI : 10.1016/S1385-7258(78)80014-6

H. Prodinger and S. Wagner, Minimal and maximal plateau lengths in Motzkin paths, Proceedings of the 2007 Conference on Analysis of Algorithms, AofA 07, Discrete Math. Theor. Comput. Sci. Proc., AH, pp.353-364, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01184768

H. S. Wilf, The distribution of run lengths in integer compositionsRe- search Paper 23, Electron. J. Combin, vol.18, issue.2, p.5, 2011.