Analysis of random LC tries
From MaRDI portal
Recommendations
Cites work
- A diffusion limit for a class of randomly-growing binary trees
- A note on the average depth of trees
- A note on the probabilistic analysis of patricia trees
- A probabilistic analysis of the height of tries and of the complexity of triesort
- A study of trie-like structures under the density model
- An inequality involving multinomial probabilities
- Analysis of Extendible Hashing
- Analysis of N-trees
- Association of Random Variables, with Applications
- Asymptotical growth of a class of random trees
- Digital Search Trees Revisited
- How many random questions are necessary to identify n distinct objects?
- scientific article; zbMATH DE number 1512698 (Why is no real title available?)
- Improved behaviour of tries by adaptive branching
- Limiting Distribution for the Depth in PATRICIA Tries
- Negative association of random variables, with applications
- On the average height of trees in digital search and dynamic hashing
- On the balance property of Patricia tries: External path length viewpoint
- On the height of digital trees and related problems
- On the performance evaluation of extendible hashing and trie searching
- On The variance of the extremal path length in a symmetric digital trie
- Patricia tries again revisited
- Searching and sorting real numbers
- Some results on V-ary asymmetric tries
- Weighted sums of certain dependent random variables
Cited in
(2)
This page was built for publication: Analysis of random LC tries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2772924)
