Towards a complete characterization of tries
From MaRDI portal
Recommendations
Cited in
(39)- Dynamical sources in information theory: A general analysis of trie structures
- Some results on tries with adaptive branching.
- scientific article; zbMATH DE number 1696631 (Why is no real title available?)
- The stack-size of combinatorial tries revisited
- Size and path length of Patricia tries: Dynamical sources context
- Trie structure for graph sequences
- On the smoothed heights of trie and patricia index trees
- A new binomial recurrence arising in a graphical compression algorithm
- On the number of 2-protected nodes in tries and suffix trees
- Multiple choice tries and distributed hash tables
- Digital trees and memoryless sources: from arithmetics to analysis
- A Uniform Approach to the Analysis of Trie Structures That Store Prefixing-Keys
- On the number of full levels in tries
- An Analysis of the Height of Tries with Random Weights on the Edges
- Average-Case Analysis of Cousins in m-ary Tries
- The height of list-tries and TST
- scientific article; zbMATH DE number 3978406 (Why is no real title available?)
- scientific article; zbMATH DE number 4007734 (Why is no real title available?)
- Variable-depth trie index optimization: theory and experimental results
- scientific article; zbMATH DE number 1303595 (Why is no real title available?)
- MULTIDIMENSIONAL DIGITAL SEARCHING AND SOME NEW PARAMETERS IN TRIES
- Generalizing generalized tries
- On a recurrence arising in graph compression
- A generalization of the trie data structure
- Trie size in a dynamic list structure
- Uncommon suffix tries
- The average profile of suffix trees
- Combinatorial Pattern Matching
- Algorithms and Data Structures
- ON CLIMBING TRIES
- Profile of Tries
- Average profiles, from tries to suffix-trees
- Towards more realistic probabilistic models for data structures: the external path length in tries under the Markov model
- On tries, contention trees and their analysis
- Improved behaviour of tries by adaptive branching
- A probabilistic analysis of the height of tries and of the complexity of triesort
- Renewal theory in the analysis of tries and strings
- Average-case analysis of approximate trie search
- Smoothed heights of tries and patricia tries
This page was built for publication: Towards a complete characterization of tries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921651)
