Concentration of Size and Path Length of Tries
From MaRDI portal
Recommendations
- Dependence between external path-length and size in random tries
- An Analysis of the Height of Tries with Random Weights on the Edges
- Variance of size in regular graph tries
- A note on the asymptotic behavior of the depth of tries
- scientific article; zbMATH DE number 891080
- New results on the size of tries
- On the search path length of random binary skip graphs
- On the Horton-Strahler number for random tries
- A concentration inequality for maximum matching size in random graphs1
- On The variance of the extremal path length in a symmetric digital trie
Cited in
(18)- On The variance of the extremal path length in a symmetric digital trie
- The stack-size of combinatorial tries revisited
- On the stack-size of general tries
- On the Horton-Strahler number for random tries
- A Uniform Approach to the Analysis of Trie Structures That Store Prefixing-Keys
- On a recurrence arising in graph compression
- Dependence between external path-length and size in random tries
- New results on the size of tries
- Trie size in a dynamic list structure
- Uncommon suffix tries
- Variance of size in regular graph tries
- Gaussian distribution of trie depth for strongly tame sources
- Profile of Tries
- Average profiles, from tries to suffix-trees
- The oscillatory distribution of distances in random tries
- Towards more realistic probabilistic models for data structures: the external path length in tries under the Markov model
- Upper tail analysis of bucket sort and random tries
- The total path length of split trees
This page was built for publication: Concentration of Size and Path Length of Tries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4670364)
