A. , M. And-stegun, and I. A. , Handbook of Mathematical Functions. Dover, 1973. A reprint of the tenth National Bureau of Standards edition, 1964.

A. Baker, Transcendental number theory, second ed, 1990.

B. , V. And-valléevall´vallée, and B. , Euclidean algorithms are Gaussian, Journal of Number Theory, vol.110, pp.331-386, 2005.

B. , V. And-valléevall´vallée, and B. , Exponential decay of correlations for surface semi-flows without finite Markov partitions, Proceedings of the American Mathematical Society, vol.133, issue.3, pp.865-874, 2005.

C. , E. And-valléevall´vallée, and B. , Gaussian distribution of trie depth for dynamical sources, 2010.

C. , J. Flajolet, P. And-valléevall´vallée, and B. , Dynamical sources in information theory: A general analysis of trie structures, Algorithmica, vol.29, issue.12, pp.307-369, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00073027

F. , G. Flajolet, P. And-hofri, and M. , On a functional equation arising in the analysis of a protocol for a multiaccess broadcast channel, Advances in Applied Probability, vol.18, pp.441-472, 1986.
URL : https://hal.archives-ouvertes.fr/inria-00076429

F. , J. A. And-janson, and S. , The number of bit comparisons used by Quicksort: An average-case analysis, Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA04), pp.293-300, 2004.

F. , P. Gourdon, X. And-dumas, and P. , Mellin transforms and asymptotics: Harmonic sums, Theoretical Computer Science, vol.144, pp.1-2, 1995.
URL : https://hal.archives-ouvertes.fr/inria-00074307

F. , P. And-sedgewick, and R. , Mellin transforms and asymptotics: finite differences and Rice's integrals, Theoretical Computer Science, vol.144, pp.1-2, 1995.

F. , P. And-sedgewick, and R. , Analytic Combinatorics, Also available electronically from the authors' home pages, 2009.

F. , P. And-valléevall´vallée, and B. , Continued fractions, comparison algorithms, and fine structure constants, Constructive, Experimental, and Nonlinear Analysis, pp.53-82

H. , G. H. And-wright, and E. M. , An Introduction to the Theory of Numbers, 1979.

J. , P. And-szpankowski, and W. , Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees, Theoretical Computer Science, vol.144, pp.1-2, 1995.

L. , M. L. And, M. Van-frankenhuijsen, and . Geometry, Complex Dimensions and Zeta Functions: Geometry and Spectra of Fractal Strings, 2006.

L. , G. And-szpankowski, and W. , Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm, IEEE Transactions on Information Theory, vol.41, issue.2, pp.478-488, 1995.

L. , G. And-szpankowski, and W. , On the average redundancy rate of the Lempel-Ziv code, IEEE Transactions on Information Theory, vol.43, issue.1, pp.2-8, 1997.

M. and J. L. Ed, Special Issue on Random-Access Communications, IT-31 of IEEE Transactions on Information Theory, 1985.

M. , H. And-robert, and P. , A probabilistic analysis of some tree algorithms, Annals of Applied Probability, vol.15, issue.4, pp.2445-2471, 2005.

M. , H. And-robert, and P. , Dynamic tree algorithms, Annals of Applied Probability, vol.20, issue.1, pp.26-51, 2010.

R. , G. And-toffin, and P. , Approximants de Padé simultanés de logarithmes, Journal of Number Theory, vol.24, issue.3, pp.284-287, 1986.

S. , R. And-flajolet, and P. , An Introduction to the Analysis of Algorithms, 1996.

V. , B. Clémentcl´clément, J. Fill, J. A. And-flajolet, and P. S. , The number of symbol comparisons in QuickSort and QuickSelect, Proceedings of the 36th International Colloquium on Automata, Languages and Programming, pp.750-763, 2009.

W. , E. T. And-watson, and G. N. , A Course of Modern Analysis, fourth ed, 1927.