Some results on V-ary asymmetric tries

This publication has 7 references indexed in Scilit:

• On a recurrence equation arising in the analysis of conflict resolution algorithms
  Communications in Statistics. Stochastic Models, 1987
• Digital Search Trees Revisited
  SIAM Journal on Computing, 1986
• Paths in a random digital tree: limiting distributions
  Advances in Applied Probability, 1986
• Analysis of a stack algorithm for random multiple-access communication
  IEEE Transactions on Information Theory, 1985
• A probabilistic analysis of the height of tries and of the complexity of triesort
  Acta Informatica, 1984
• On the performance evaluation of extendible hashing and trie searching
  Acta Informatica, 1983
• Extendible hashing—a fast access method for dynamic files
  ACM Transactions on Database Systems, 1979