The following pages link to The Ubiquitous Digital Tree (Q5449784):
Displaying 12 items.
- Weighted height of random trees (Q934911) (← links)
- Profiles of PATRICIA tries (Q1702132) (← links)
- Dynamical sources in information theory: A general analysis of trie structures (Q1840518) (← links)
- Some results on tries with adaptive branching. (Q1853567) (← links)
- Dynamic interpolation search revisited (Q2288214) (← links)
- Digital access to comparison-based tree data structures and algorithms (Q2746435) (← links)
- Trie structure for graph sequences (Q2789555) (← links)
- A new binomial recurrence arising in a graphical compression algorithm (Q2920840) (← links)
- (Q4633819) (← links)
- Dependence between path-length and size in random digital trees (Q4684912) (← links)
- Gaussian Distribution of Trie Depth for Strongly Tame Sources (Q5364227) (← links)
- Towards a Realistic Analysis of Some Popular Sorting Algorithms (Q5364228) (← links)