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

P. Flajolet and A. M. Odlyzko, Singularity Analysis of Generating Functions, SIAM Journal on Discrete Mathematics, vol.3, issue.2, pp.216-240, 1990.
DOI : 10.1137/0403019
URL : https://hal.archives-ouvertes.fr/inria-00075725

P. Kirschenhofer and H. Prodinger, On the analysis of probabilistic counting, Number?theoretic Analysis, pp.117-120, 1990.
DOI : 10.1137/0215054

P. Kirschenhofer and H. Prodinger, Ein Ergebnis der Ordnungsstatistik mit Anwendung auf probabilistischs Z??hlen, Computing, vol.43, issue.1, pp.15-27, 1993.
DOI : 10.1007/BF02243826

P. Kirschenhofer and H. Prodinger, The path length of random skip lists, Acta Informatica, vol.43, issue.42, pp.775-792, 1994.
DOI : 10.1007/BF01178735

P. Kirschenhofer, H. Prodinger, and W. Szpankowski, Analysis of a splitting process arising in probabilistic counting and other related algorithms, Random Structures and Algorithms, vol.9, issue.4, pp.379-401, 1996.
DOI : 10.1002/(SICI)1098-2418(199612)9:4<379::AID-RSA3>3.0.CO;2-U

A. Knopfmacher and H. Prodinger, Combinatorics of geometrically distributed random variables: Value and position of the rth left-to-right maximum, Discrete Mathematics, vol.226, issue.1-3, pp.255-267, 2001.
DOI : 10.1016/S0012-365X(00)00133-3

A. Knopfmacher and H. Prodinger, The Number of Descents in Samples of Geometric Random Variables, Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities, pp.339-350, 2004.
DOI : 10.1007/978-3-0348-7915-6_35

D. E. Knuth, The art of computer programming Sorting and Searching, 1973.

D. E. Knuth, The art of computer programming

T. Papadakis, I. Munro, and P. Poblete, Average search and update costs in skip lists, BIT, vol.33, issue.6, pp.316-332, 1992.
DOI : 10.1007/BF01994884

H. Prodinger, Combinatorics of geometrically distributed random variables: Left-to-right maxima, Discrete Mathematics, vol.153, issue.1-3, pp.253-270, 1996.
DOI : 10.1016/0012-365X(95)00141-I

H. Prodinger, Combinatorics of Geometrically Distributed Random Variables: Length of Ascending Runs, Proceedings of LATIN'2000, Lecture Notes in Comp. Sci. 1776, pp.473-482, 2000.
DOI : 10.1007/10719839_47

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

N. J. Sloane and S. Plouffe, The encyclopaedia of integer sequences, 1995.