On the average depth of asymmetric LC-tries
From MaRDI portal
Publication:1044716
DOI10.1016/j.ipl.2005.06.008zbMath1184.68225MaRDI QIDQ1044716
Publication date: 18 December 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2005.06.008
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved behaviour of tries by adaptive branching
- Asymptotical growth of a class of random trees
- A note on the average depth of trees
- Special issue: Average-case analysis of algorithms
- Analysis of random LC tries
- On the number of full levels in tries
- Singularity Analysis of Generating Functions
- Digital Search Trees Revisited
- Some results on V-ary asymmetric tries
- A note on the probabilistic analysis of patricia trees
- Probabilistic behavior of asymmetric level compressed tries