Analysis of random LC tries
From MaRDI portal
Publication:2772924
DOI10.1002/rsa.10006zbMath0992.68035OpenAlexW2066574146MaRDI QIDQ2772924
Publication date: 19 February 2002
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.10006
Related Items (2)
Probabilistic behavior of asymmetric level compressed tries ⋮ On the average depth of asymmetric LC-tries
Cites Work
- Unnamed Item
- Improved behaviour of tries by adaptive branching
- A probabilistic analysis of the height of tries and of the complexity of triesort
- On the height of digital trees and related problems
- On the performance evaluation of extendible hashing and trie searching
- Asymptotical growth of a class of random trees
- A diffusion limit for a class of randomly-growing binary trees
- On the balance property of Patricia tries: External path length viewpoint
- On the average height of trees in digital search and dynamic hashing
- A note on the average depth of trees
- A study of trie-like structures under the density model
- On The variance of the extremal path length in a symmetric digital trie
- How many random questions are necessary to identify \(n\) distinct objects?
- Analysis of N-trees
- Negative association of random variables, with applications
- Weighted sums of certain dependent random variables
- Patricia tries again revisited
- Digital Search Trees Revisited
- Some results on V-ary asymmetric tries
- Searching and sorting real numbers
- Analysis of Extendible Hashing
- A note on the probabilistic analysis of patricia trees
- Limiting Distribution for the Depth in PATRICIA Tries
- An inequality involving multinomial probabilities
- Association of Random Variables, with Applications
This page was built for publication: Analysis of random LC tries