Analysis of digital tries with Markovian dependency

This publication has 15 references indexed in Scilit:

• Trie hashing analysis
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
• On the height of digital trees and related problems
  Algorithmica, 1991
• New results on the size of tries
  IEEE Transactions on Information Theory, 1989
• Some results on V-ary asymmetric tries
  Journal of Algorithms, 1988
• Further results on digital search trees
  Theoretical Computer Science, 1988
• The evaluation of an alternative sum with applications to the analysis of some data structures
  Information Processing Letters, 1988
• Paths in a random digital tree: limiting distributions
  Advances in Applied Probability, 1986
• Asymptotical Growth of a Class of Random Trees
  The Annals of Probability, 1985
• Tree algorithms for packet broadcast channels
  IEEE Transactions on Information Theory, 1979
• Extendible hashing—a fast access method for dynamic files
  ACM Transactions on Database Systems, 1979