Digital search trees with keys of variable length
Nebel, Markus E.
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 30 (1996), p. 507-520 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1996-01-01
@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},
     volume = {30},
     year = {1996},
     pages = {507-520},
     mrnumber = {1454827},
     zbl = {0877.68091},
     language = {en},
     url = {http://dml.mathdoc.fr/item/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) pp. 507-520. http://gdmltest.u-ga.fr/item/ITA_1996__30_6_507_0/

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

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

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

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

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

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