The following pages link to (Q3742733):
Displaying 22 items.
- The expected profile of digital search trees (Q549244) (← links)
- The oscillatory distribution of distances in random tries (Q558689) (← links)
- On tries, contention trees and their analysis (Q659773) (← links)
- Mellin transforms and asymptotics: Harmonic sums (Q672981) (← links)
- On the variance of a class of inductive valuations of data structures for digital search (Q672993) (← links)
- A note on binomial recurrences arising in the analysis of algorithms (Q685508) (← links)
- Renewal theory in the analysis of tries and strings (Q764315) (← links)
- On the height of digital trees and related problems (Q922689) (← links)
- Analytical depoissonization and its applications (Q1129001) (← links)
- A characterization of digital search trees from the successful search viewpoint (Q1183573) (← links)
- On the distribution for the duration of a randomized leader election algorithm (Q1354843) (← links)
- Laws of large numbers and tail inequalities for random tries and PATRICIA trees (Q1612291) (← links)
- On the variety of shapes in digital trees (Q1692230) (← links)
- Expected worst-case partial match in random quadtries (Q1827855) (← links)
- Some results on tries with adaptive branching. (Q1853567) (← links)
- An analytic approach to the asymptotic variance of trie statistics and related structures (Q2437771) (← links)
- A probabilistic analysis of some tree algorithms (Q2496496) (← links)
- Exact and asymptotic distributions in digital and binary search trees (Q3785960) (← links)
- Universal Limit Laws for Depths in Random Trees (Q4210155) (← links)
- Dependence between path-length and size in random digital trees (Q4684912) (← links)
- Trie size in a dynamic list structure (Q5044775) (← links)
- Gaussian Distribution of Trie Depth for Strongly Tame Sources (Q5364227) (← links)
