The following pages link to (Q3730026):
Displaying 14 items.
- The oscillatory distribution of distances in random tries (Q558689) (← links)
- On the variance of a class of inductive valuations of data structures for digital search (Q672993) (← links)
- Improved behaviour of tries by adaptive branching (Q685503) (← links)
- Further results on digital search trees (Q1110340) (← links)
- The evaluation of an alternative sum with applications to the analysis of some data structures (Q1111028) (← links)
- On the balance property of Patricia tries: External path length viewpoint (Q1124339) (← links)
- A characterization of digital search trees from the successful search viewpoint (Q1183573) (← links)
- On The variance of the extremal path length in a symmetric digital trie (Q1262137) (← links)
- Laws of large numbers and tail inequalities for random tries and PATRICIA trees (Q1612291) (← links)
- Some results on tries with adaptive branching. (Q1853567) (← links)
- Exact and asymptotic distributions in digital and binary search trees (Q3785960) (← links)
- (Q4633819) (← links)
- The Ubiquitous Digital Tree (Q5449784) (← links)
- On 2-protected nodes in random digital trees (Q5964078) (← links)