G. Andrews, The Theory of Partitions, of Encyclopedia of Mathematics and its Applications, 1976.
DOI : 10.1017/CBO9780511608650

J. Cicho´ncicho´n and W. Macyna, Approximate counters for flash memory, 17th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA), 2011.

P. Flajolet and R. Sedgewick, Digital Search Trees Revisited, SIAM Journal on Computing, vol.15, issue.3, pp.748-767, 1986.
DOI : 10.1137/0215054
URL : https://hal.archives-ouvertes.fr/inria-00076246

P. Flajolet and R. Sedgewick, Mellin transforms and asymptotics, Acta Informatica, vol.32, issue.4, pp.101-124, 1995.
DOI : 10.1007/BF01177551
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

R. Kemp, Die mittlere H??he r-fach gewurzelter planarer B??ume, Computing, vol.6, issue.3, pp.209-232, 1980.
DOI : 10.1007/BF02242000

P. Kirschenhofer and H. Prodinger, Further results on digital search trees, Theoretical Computer Science, vol.58, issue.1-3, pp.143-154, 1988.
DOI : 10.1016/0304-3975(88)90023-0

P. Kirschenhofer and H. Prodinger, Approximate counting : an alternative approach, RAIRO - Theoretical Informatics and Applications, vol.25, issue.1, pp.43-48, 1991.
DOI : 10.1051/ita/1991250100431

D. E. Knuth, The Art of Computer Programming Sorting and Searching, 1973.

G. Louchard, Exact and asymptotic distributions in digital and binarysearch trees, Theoretical Informatics and Applications, pp.479-495, 1987.

H. Mahmoud, Evolution of Random Search Trees, 1992.

H. Prodinger, Hypothetical analyses: approximate counting in the style of Knuth, path length in the style of Flajolet, Theoretical Computer Science, vol.100, issue.1, pp.243-251, 1992.
DOI : 10.1016/0304-3975(92)90371-L

H. Prodinger, Digital search trees and basic hypergeometric functions, EATCS Bulletin, vol.56, pp.112-115, 1995.

H. Prodinger, Approximate counting with m counters: a detailed analysis. submitted, 2011.

W. Szpankowski, A characterization of digital search trees from the successful search viewpoint, Theoretical Computer Science, vol.85, issue.1, pp.117-134, 1991.
DOI : 10.1016/0304-3975(91)90050-C