Pages that link to "Item:Q2921651"
From MaRDI portal
The following pages link to Towards a complete characterization of tries (Q2921651):
Displaying 22 items.
- On a recurrence arising in graph compression (Q456337) (← links)
- On tries, contention trees and their analysis (Q659773) (← links)
- Improved behaviour of tries by adaptive branching (Q685503) (← links)
- A probabilistic analysis of the height of tries and of the complexity of triesort (Q760797) (← links)
- Renewal theory in the analysis of tries and strings (Q764315) (← links)
- Average-case analysis of approximate trie search (Q866965) (← links)
- Smoothed heights of tries and patricia tries (Q896160) (← links)
- A note on the asymptotic behavior of the depth of tries (Q1277381) (← links)
- Dynamical sources in information theory: A general analysis of trie structures (Q1840518) (← links)
- Some results on tries with adaptive branching. (Q1853567) (← links)
- The stack-size of combinatorial tries revisited (Q2768447) (← links)
- Size and path length of Patricia tries: Dynamical sources context (Q2772922) (← links)
- Trie structure for graph sequences (Q2789555) (← links)
- A new binomial recurrence arising in a graphical compression algorithm (Q2920840) (← links)
- On the number of 2-protected nodes in tries and suffix trees (Q2920872) (← links)
- A Uniform Approach to the Analysis of Trie Structures That Store Prefixing-Keys (Q3128196) (← links)
- On the number of full levels in tries (Q3159456) (← links)
- Average-Case Analysis of Cousins in <i>m</i>-ary Tries (Q3535643) (← links)
- Trie size in a dynamic list structure (Q5044775) (← links)
- Uncommon suffix tries (Q5175232) (← links)
- Combinatorial Pattern Matching (Q5315354) (← links)
- Profile of Tries (Q5458512) (← links)
