Dynamical sources in information theory: A general analysis of trie structures
From MaRDI portal
Publication:1840518
zbMath1035.68039MaRDI QIDQ1840518
Philippe Flajolet, Brigitte Vallée, Julien Clément
Publication date: 2001
Published in: Algorithmica (Search for Journal in Brave)
Entropy and other invariants, isomorphism, classification in ergodic theory (37A35) Data structures (68P05) Symbolic dynamics (37B10)
Related Items
Towards a realistic analysis of the QuickSelect algorithm, Context Trees, Variable Length Markov Chains and Dynamical Sources, The Depoissonisation quintet: Rice-Poisson-Mellin-Newton-Laplace, A general central limit theorem for shape parameters of \(m\)-ary tries and PATRICIA tries, Gaussian Distribution of Trie Depth for Strongly Tame Sources, Towards a Realistic Analysis of Some Popular Sorting Algorithms, Distributional convergence for the number of symbol comparisons used by QuickSort, Lochs-type theorems beyond positive entropy, An analytic approach to the asymptotic variance of trie statistics and related structures, Process convergence for the complexity of radix selection on Markov sources, Multikey quickselect, Weighted height of random trees, Multiple pattern matching: a Markov chain approach, Uncommon suffix tries, On the Stack-Size of General Tries, About randomised distributed graph colouring and graph partition algorithms, A probabilistic analysis of some tree algorithms, Dependence between path-length and size in random digital trees, Dichotomic Selection on Words: A Probabilistic Analysis, Upper tail analysis of bucket sort and random tries, Upper tail analysis of bucket sort and random tries, Renewal theory in the analysis of tries and strings, Distributional Convergence for the Number of Symbol Comparisons Used by Quickselect, Laws of large numbers and tail inequalities for random tries and PATRICIA trees
