Limiting Distribution for the Depth in PATRICIA Tries

This publication has 19 references indexed in Scilit:

• Trie partitioning process: Limiting distributions
  Published by Springer Nature ,2005
• A Study of Trie-Like Structures Under the Density Model
  The Annals of Applied Probability, 1992
• Ultimate Characterizations of the Burst Response of an Interval Searching Algorithm: A Study of a Functional Equation
  SIAM Journal on Computing, 1989
• Probabilistic Analysis of Algorithms
  Published by Springer Nature ,1987
• The Myriad Virtues of Subword Trees
  Published by Springer Nature ,1985
• Some Uses of the Mellin Integral Transform in the Analysis of Algorithms
  Published by Springer Nature ,1985
• The analysis of linear probing sort by the use of a new mathematical transform
  Journal of Algorithms, 1984
• On the performance evaluation of extendible hashing and trie searching
  Acta Informatica, 1983
• 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