G. Hällström, Ein lineares Inselproblem der kombinatorischen Wahrscheinlichkeitsrechnung, Ann. Acad. Sci. Fennicae. Ser. A. I. Math.-Phys, vol.123, issue.9, p.pp, 1952.

A. D. Barbour, A note on the maximum size of a closed epidemic, J. Roy. Statist. Soc. Ser. B, vol.37, issue.3, pp.459-460, 1975.

A. D. Barbour, Brownian motion and a sharply curved boundary, Advances in Applied Probability, vol.37, issue.04, pp.736-750, 1981.
DOI : 10.1137/1115007

P. Billingsley, Convergence of Probability Measures, 1968.
DOI : 10.1002/9780470316962

H. E. Daniels, The maximum size of a closed epidemic, Advances in Applied Probability, vol.40, issue.04, pp.607-621, 1974.
DOI : 10.1137/1115007

H. E. Daniels, The maximum of a Gaussian process whose mean path has a maximum, with an application to the strength of bundles of fibres, Advances in Applied Probability, vol.37, issue.02, pp.315-333, 1989.
DOI : 10.1007/BF02868560

H. E. Daniels and T. H. Skyrme, The maximum of a random walk whose mean path has a maximum, Advances in Applied Probability, vol.37, issue.01, pp.85-99, 1985.
DOI : 10.2307/1426182

P. Flajolet, Combinatorial aspects of continued fractions, Discrete Mathematics, vol.32, issue.3, pp.125-161, 1980.
DOI : 10.1016/0012-365X(80)90248-4

P. Flajolet, J. Françon, and &. J. Vuillemin, Sequence of operations analysis for dynamic data structures, Journal of Algorithms, vol.1, issue.2, pp.111-141, 1980.
DOI : 10.1016/0196-6774(80)90020-6

P. Flajolet, C. Puech, and &. J. Vuillemin, The analysis of simple list structures, Information Sciences, vol.38, issue.2, pp.121-146, 1986.
DOI : 10.1016/0020-0255(86)90016-2

URL : https://hal.archives-ouvertes.fr/inria-00076317

P. Groeneboom, Brownian motion with a parabolic drift and airy functions, Probability Theory and Related Fields, vol.28, issue.1, pp.79-109, 1989.
DOI : 10.1112/plms/s3-28.4.738

S. Janson, A functional limit theorem for random graphs with applications to subgraph count statistics, Random Structures and Algorithms, vol.78, issue.1, pp.15-37, 1990.
DOI : 10.1002/rsa.3240010103

S. Janson, Orthogonal decompositions and functional limit theorems for random graph statistics, Memoirs of the American Mathematical Society, vol.111, issue.534, 1994.
DOI : 10.1090/memo/0534

S. Janson, Sorting Using Complete Subintervals and the Maximum Number of Runs in a Randomly Evolving Sequence, Annals of Combinatorics, vol.1, issue.4
DOI : 10.1007/s00026-009-0007-z

URL : https://hal.archives-ouvertes.fr/hal-01184796

C. M. Kenyon and &. J. Vitter, Maximum queue size and hashing with lazy deletion, Algorithmica, vol.1, issue.1, pp.597-619, 1991.
DOI : 10.1007/BF01759063

J. C. Lagarias, A. M. Odlyzko, and D. B. Zagier, On the capacity of disjointly shared networks, Computer Networks and ISDN Systems, vol.10, issue.5, pp.275-285, 1985.
DOI : 10.1016/0169-7552(85)90070-4

W. V. Li and &. G. Pritchard, A central limit theorem for the sock-sorting problem. High dimensional probability (Oberwolfach, Progr. Probab, pp.245-248, 1996.

G. Louchard, Random walks, Gaussian processes and list structures, Theoretical Computer Science, vol.53, issue.1, pp.99-124, 1987.
DOI : 10.1016/0304-3975(87)90028-4

URL : http://doi.org/10.1016/0304-3975(87)90028-4

G. Louchard, Large finite population queueing systems part i: the infinite server model., Communications in Statistics. Stochastic Models, vol.1, issue.3, pp.473-505, 1988.
DOI : 10.1007/BF00532559

G. Louchard, C. Kenyon, and &. R. Schott, Data Structures' Maxima, SIAM Journal on Computing, vol.26, issue.4, pp.1006-1042, 1997.
DOI : 10.1137/S0097539791196603

URL : https://hal.archives-ouvertes.fr/inria-00075166

A. M. Mood, The Distribution Theory of Runs, The Annals of Mathematical Statistics, vol.11, issue.4, pp.367-392, 1940.
DOI : 10.1214/aoms/1177731825

D. Steinsaltz, Random Time Changes for Sock-Sorting and Other Stochastic Process Limit Theorems, Electronic Journal of Probability, vol.4, issue.0, p.pp, 1999.
DOI : 10.1214/EJP.v4-51

W. L. Stevens, DISTRIBUTION OF GROUPS IN A SEQUENCE OF ALTERNATIVES, Annals of Eugenics, vol.11, issue.1, pp.10-17, 1939.
DOI : 10.1111/j.1469-1809.1939.tb02193.x

C. J. Van-wyk and &. J. Vitter, The complexity of hashing with lazy deletion, Algorithmica, vol.1, issue.1-4, pp.17-29, 1986.
DOI : 10.1007/BF01840434