Digital search trees with keys of variable length
RAIRO. 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. Informatique th\'eorique et applications},
pages = {507--520},
year = {1996},
publisher = {EDP-Sciences},
volume = {30},
number = {6},
mrnumber = {1454827},
zbl = {0877.68091},
language = {en},
url = {https://www.numdam.org/item/ITA_1996__30_6_507_0/}
}
Nebel, Markus E. Digital search trees with keys of variable length. RAIRO. Informatique théorique et applications, Tome 30 (1996) no. 6, pp. 507-520. https://www.numdam.org/item/ITA_1996__30_6_507_0/
1. , Introduction to Analytic Number Theory, Springer-Verlag, 1976. | Zbl | MR
2. and , Mellin transforms and asymptotics, Acta Informatica, 1994, 31, pp. 673-696. | Zbl | MR
3. and , Digital Search Trees Revisited, SIAM Journ. of Comput., 1986, 15, n° 3, pp. 748-767. | Zbl | MR
4. and , Handbook of Algorithms and Data Structures, Addison-Wesley, 1991. | Zbl
5. and , Further Results on Digital Search Trees, Theoretical Computer Science, 1988, 58, pp. 143-154. | Zbl | MR
6. , The Art of Computer Programming, Vol. 3: Sorting and Searching, Addison-Wesley, 1973. | MR





