no. 6
Digital search trees with keys of variable length
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 30 (1996) no. 6, pp. 507-520. 
@article{ITA_1996__30_6_507_0,
     author = {Nebel, Markus E.},
     title = {Digital search trees with keys of variable length},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {507--520},
     publisher = {EDP-Sciences},
     volume = {30},
     number = {6},
     year = {1996},
     mrnumber = {1454827},
     zbl = {0877.68091},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_1996__30_6_507_0/}
}
TY  - JOUR
AU  - Nebel, Markus E.
TI  - Digital search trees with keys of variable length
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1996
SP  - 507
EP  - 520
VL  - 30
IS  - 6
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1996__30_6_507_0/
LA  - en
ID  - ITA_1996__30_6_507_0
ER  - 
%0 Journal Article
%A Nebel, Markus E.
%T Digital search trees with keys of variable length
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1996
%P 507-520
%V 30
%N 6
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1996__30_6_507_0/
%G en
%F ITA_1996__30_6_507_0
Nebel, Markus E. Digital search trees with keys of variable length. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 30 (1996) no. 6, pp. 507-520. http://archive.numdam.org/item/ITA_1996__30_6_507_0/

1. T. M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, 1976. | MR | Zbl

2. P. Flajolet and M. Golin, Mellin transforms and asymptotics, Acta Informatica, 1994, 31, pp. 673-696. | MR | Zbl

3. P. Flajolet and R. Sedgewick, Digital Search Trees Revisited, SIAM Journ. of Comput., 1986, 15, n° 3, pp. 748-767. | MR | Zbl

4. G. H. Gonnet and R. Baeza-Yates, Handbook of Algorithms and Data Structures, Addison-Wesley, 1991. | Zbl

5. P. Kirschenhofer and H. Prodinger, Further Results on Digital Search Trees, Theoretical Computer Science, 1988, 58, pp. 143-154. | MR | Zbl

6. D. E. Knuth, The Art of Computer Programming, Vol. 3: Sorting and Searching, Addison-Wesley, 1973. | MR