Pages that link to "Item:Q4670364"
From MaRDI portal
The following pages link to Concentration of Size and Path Length of Tries (Q4670364):
Displaying 11 items.
- On a recurrence arising in graph compression (Q456337) (← links)
- The total path length of split trees (Q691101) (← links)
- On The variance of the extremal path length in a symmetric digital trie (Q1262137) (← links)
- The stack-size of combinatorial tries revisited (Q2768447) (← links)
- On the stack-size of general tries (Q2771494) (← links)
- On the Horton-Strahler number for random tries (Q3126013) (← links)
- A Uniform Approach to the Analysis of Trie Structures That Store Prefixing-Keys (Q3128196) (← links)
- Partial fillup and search time in LC tries (Q4962683) (← links)
- Trie size in a dynamic list structure (Q5044775) (← links)
- Uncommon suffix tries (Q5175232) (← links)
- Upper tail analysis of bucket sort and random tries (Q5925674) (← links)