Digital search trees with keys of variable length

Markus E. Nebel

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1996)

  • Volume: 30, Issue: 6, page 507-520
  • ISSN: 0988-3754

How to cite

top

Nebel, Markus E.. "Digital search trees with keys of variable length." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 30.6 (1996): 507-520. <http://eudml.org/doc/92549>.

@article{Nebel1996,
author = {Nebel, Markus E.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {digital search trees},
language = {eng},
number = {6},
pages = {507-520},
publisher = {EDP-Sciences},
title = {Digital search trees with keys of variable length},
url = {http://eudml.org/doc/92549},
volume = {30},
year = {1996},
}

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
PB - EDP-Sciences
VL - 30
IS - 6
SP - 507
EP - 520
LA - eng
KW - digital search trees
UR - http://eudml.org/doc/92549
ER -

References

top
  1. 1. T. M. APOSTOL, Introduction to Analytic Number Theory, Springer-Verlag, 1976. Zbl0335.10001MR434929
  2. 2. P. FLAJOLET and M. GOLIN, Mellin transforms and asymptotics, Acta Informatica, 1994, 31, pp. 673-696. Zbl0818.68064MR1300060
  3. 3. P. FLAJOLET and R. SEDGEWICK, Digital Search Trees Revisited, SIAM Journ. of Comput., 1986, 15, n° 3, pp. 748-767. Zbl0611.68041MR850421
  4. 4. G. H. GONNET and R. BAEZA-YATES, Handbook of Algorithms and Data Structures, Addison-Wesley, 1991. Zbl0719.68001
  5. 5. P. KIRSCHENHOFER and H. PRODINGER, Further Results on Digital Search Trees, Theoretical Computer Science, 1988, 58, pp. 143-154. Zbl0656.68067MR963259
  6. 6. D. E. KNUTH, The Art of Computer Programming, Vol. 3: Sorting and Searching, Addison-Wesley, 1973. Zbl0302.68010MR445948

NotesEmbed ?

top

You must be logged in to post comments.