A probabilistic analysis of the height of tries and of the complexity of triesort

This publication has 7 references indexed in Scilit:

• A note on the average depth of tries
  Computing, 1982
• A branching process arising in dynamic hashing, trie searching and polynomial factorization
  Published by Springer Nature ,1982
• On the average height of trees in digital search and dynamic hashing
  Information Processing Letters, 1981
• Laws of the Iterated Logarithm for Order Statistics of Uniform Spacings
  The Annals of Probability, 1981
• A note on the analysis of extendible hashing
  Information Processing Letters, 1980
• Measure and Integral
  Published by Taylor & Francis ,1977
• Trie memory
  Communications of the ACM, 1960