Faster searching in tries and quadtrees—An analysis of level compression

This publication has 13 references indexed in Scilit:

• Improved behaviour of tries by adaptive branching
  Information Processing Letters, 1993
• Efficient pattern matching with scaling
  Journal of Algorithms, 1992
• A guided tour of chernoff bounds
  Information Processing Letters, 1990
• Paths in a random digital tree: limiting distributions
  Advances in Applied Probability, 1986
• Some further results on digital search trees
  Lecture Notes in Computer Science, 1986
• Asymptotical Growth of a Class of Random Trees
  The Annals of Probability, 1985
• On the performance evaluation of extendible hashing and trie searching
  Acta Informatica, 1983
• A note on the average depth of tries
  Computing, 1982
• Trie memory
  Communications of the ACM, 1960
• A Method for the Construction of Minimum-Redundancy Codes
  Proceedings of the IRE, 1952