Pages that link to "Item:Q672993"
From MaRDI portal
The following pages link to On the variance of a class of inductive valuations of data structures for digital search (Q672993):
Displaying 6 items.
- A general central limit theorem for shape parameters of \(m\)-ary tries and PATRICIA tries (Q405180) (← links)
- On the variance of the internal path length of generalized digital trees -- the Mellin convolution approach (Q1575544) (← links)
- On the variety of shapes in digital trees (Q1692230) (← links)
- An analytic approach to the asymptotic variance of trie statistics and related structures (Q2437771) (← links)
- Dependence between path-length and size in random digital trees (Q4684912) (← links)
- Asymptotic normality for the size of graph tries built from M-ary tree labelings (Q6132968) (← links)
