Trie partitioning process: Limiting distributions

This publication has 9 references indexed in Scilit:

• Analysis of a stack algorithm for random multiple-access communication
  IEEE Transactions on Information Theory, 1985
• Some Uses of the Mellin Integral Transform in the Analysis of Algorithms
  Published by Springer Nature ,1985
• Tree structures for partial match retrieval
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1983
• Digital search trees and the generation of an exponentially distributed variate
  Published by Springer Nature ,1983
• On the performance evaluation of extendible hashing and trie searching
  Acta Informatica, 1983
• A branching process arising in dynamic hashing, trie searching and polynomial factorization
  Published by Springer Nature ,1982
• Trie hashing
  Published by Association for Computing Machinery (ACM) ,1981
• Extendible hashing—a fast access method for dynamic files
  ACM Transactions on Database Systems, 1979
• Dynamic hashing
  BIT Numerical Mathematics, 1978