Pages that link to "Item:Q3575480"
From MaRDI portal
The following pages link to Asymptotic variance of random symmetric digital search trees (Q3575480):
Displayed 15 items.
- Approximate counting with \(m\) counters: a probabilistic analysis (Q307930) (← links)
- A general central limit theorem for shape parameters of \(m\)-ary tries and PATRICIA tries (Q405180) (← links)
- Notes on protected nodes in digital search trees (Q419140) (← links)
- Approximate counting with \(m\) counters: A detailed analysis (Q441872) (← links)
- Words with a generalized restricted growth property (Q740479) (← 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)
- From coin tossing to rock-paper-scissors and beyond: a log-exp gap theorem for selecting a leader (Q4684848) (← links)
- Dependence between path-length and size in random digital trees (Q4684912) (← links)
- The Depoissonisation quintet: Rice-Poisson-Mellin-Newton-Laplace (Q4993557) (← links)
- Normal Limit Law for Protected Node Profile of Random Recursive Trees (Q5046635) (← links)
- A binomial splitting process in connection with corner parking problems (Q5176515) (← links)
- The Wiener Index of Random Digital Trees (Q5251627) (← links)
- On 2-protected nodes in random digital trees (Q5964078) (← links)
- Node profiles of symmetric digital search trees: Concentration properties (Q6049998) (← links)