Publication:2959908
From MaRDI portal
zbMath1355.68062MaRDI QIDQ2959908
Brigitte Vallée, Mathieu Roux, Philippe Flajolet
Publication date: 10 February 2017
Full work available at URL: http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAM0117
Mellin transform; analysis of algorithms; trie; digital tree; memoryless sources; complex asymptotics
Related Items
From coin tossing to rock-paper-scissors and beyond: a log-exp gap theorem for selecting a leader, The fluctuations of the giant cluster for percolation on random split trees, Inversions in Split Trees and Conditional Galton–Watson Trees, On 2-protected nodes in random digital trees, The asymptotic distribution of cluster sizes for supercritical percolation on random split trees, Asymptotic normality for the size of graph tries built from M-ary tree labelings, A general central limit theorem for shape parameters of \(m\)-ary tries and PATRICIA tries, The total path length of split trees, On the variety of shapes in digital trees, Calculation of precise constants in a probability model of Zipf's law generation and asymptotics of sums of multinomial coefficients, Central limit theorems for additive functionals and fringe trees in tries, An analytic approach to the asymptotic variance of trie statistics and related structures, Context Trees, Variable Length Markov Chains and Dynamical Sources, A weakly 1-stable distribution for the number of random records and cuttings in split trees, Zeta functions and solutions of Falconer-type problems for self-similar subsets of ℤn
