Pages that link to "Item:Q1840518"
From MaRDI portal
The following pages link to Dynamical sources in information theory: A general analysis of trie structures (Q1840518):
Displaying 31 items.
- Towards a realistic analysis of the QuickSelect algorithm (Q290901) (← links)
- A general central limit theorem for shape parameters of \(m\)-ary tries and PATRICIA tries (Q405180) (← links)
- Multikey quickselect (Q472494) (← links)
- About randomised distributed graph colouring and graph partition algorithms (Q710742) (← links)
- Renewal theory in the analysis of tries and strings (Q764315) (← links)
- A unifying framework for trie design heuristics (Q911258) (← links)
- Weighted height of random trees (Q934911) (← links)
- Multiple pattern matching: a Markov chain approach (Q938109) (← links)
- A study of trie-like structures under the density model (Q1198580) (← links)
- Laws of large numbers and tail inequalities for random tries and PATRICIA trees (Q1612291) (← links)
- Process convergence for the complexity of radix selection on Markov sources (Q1713466) (← links)
- Dynamical sources in information theory: Fundamental intervals and word prefixes (Q1840516) (← links)
- Distributional convergence for the number of symbol comparisons used by QuickSort (Q1950265) (← 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)
- Lochs-type theorems beyond positive entropy (Q2696254) (← links)
- On the stack-size of general tries (Q2771494) (← links)
- Size and path length of Patricia tries: Dynamical sources context (Q2772922) (← links)
- Information theory: sources, Dirichlet series, and realistic analyses of data structures (Q2789530) (← links)
- Distributional convergence for the number of symbol comparisons used by QuickSelect (Q2837754) (← links)
- Context Trees, Variable Length Markov Chains and Dynamical Sources (Q2906153) (← links)
- Towards a complete characterization of tries (Q2921651) (← links)
- Dependence between path-length and size in random digital trees (Q4684912) (← links)
- The Depoissonisation quintet: Rice-Poisson-Mellin-Newton-Laplace (Q4993557) (← links)
- Trie size in a dynamic list structure (Q5044775) (← links)
- Dichotomic Selection on Words: A Probabilistic Analysis (Q5088910) (← links)
- Uncommon suffix tries (Q5175232) (← links)
- Gaussian Distribution of Trie Depth for Strongly Tame Sources (Q5364227) (← links)
- Towards a Realistic Analysis of Some Popular Sorting Algorithms (Q5364228) (← links)
- Upper tail analysis of bucket sort and random tries (Q5925527) (← links)
- Upper tail analysis of bucket sort and random tries (Q5925674) (← links)
