On the average depth of asymmetric LC-tries
From MaRDI portal
Recommendations
- A note on the asymptotic behavior of the depth of tries
- Analysis of random LC tries
- Probabilistic behavior of asymmetric level compressed tries
- Some results on V-ary asymmetric tries
- Lower bounds for approximate LDCs
- On The variance of the extremal path length in a symmetric digital trie
- The lexicographic complexity of asymmetric binary relations
Cites work
- A note on the average depth of trees
- A note on the probabilistic analysis of patricia trees
- Analysis of random LC tries
- Asymptotical growth of a class of random trees
- Digital Search Trees Revisited
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 1303595 (Why is no real title available?)
- Improved behaviour of tries by adaptive branching
- On the number of full levels in tries
- Probabilistic behavior of asymmetric level compressed tries
- Singularity Analysis of Generating Functions
- Some results on V-ary asymmetric tries
- Special issue: Average-case analysis of algorithms
Cited in
(7)- A note on the asymptotic behavior of the depth of tries
- Analysis of random LC tries
- scientific article; zbMATH DE number 5763326 (Why is no real title available?)
- scientific article; zbMATH DE number 4007734 (Why is no real title available?)
- Some results on V-ary asymmetric tries
- Asymmetric Rényi problem
- Probabilistic behavior of asymmetric level compressed tries
This page was built for publication: On the average depth of asymmetric LC-tries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044716)
