Digital trees and memoryless sources: from arithmetics to analysis
From MaRDI portal
Publication:2959908
Recommendations
Cited in
(21)- Asymptotic normality for the size of graph tries built from M-ary tree labelings
- The total path length of split trees
- A general central limit theorem for shape parameters of m-ary tries and PATRICIA tries
- A new binomial recurrence arising in a graphical compression algorithm
- Context trees, variable length Markov chains and dynamical sources
- Calculation of precise constants in a probability model of Zipf's law generation and asymptotics of sums of multinomial coefficients
- On time-space efficiency of digital trees with adaptive multidigit branching
- On 2-protected nodes in random digital trees
- On a recurrence arising in graph compression
- Central limit theorems for additive functionals and fringe trees in tries
- The asymptotic distribution of cluster sizes for supercritical percolation on random split trees
- 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
- A weakly 1-stable distribution for the number of random records and cuttings in split trees
- An analytic approach to the asymptotic variance of trie statistics and related structures
- On the variety of shapes in digital trees
- Dynamical sources in information theory: A general analysis of trie structures
- Size and path length of Patricia tries: Dynamical sources context
- Zeta functions and solutions of Falconer-type problems for self-similar subsets of \(\mathbb{Z}^n\)
- scientific article; zbMATH DE number 2127731 (Why is no real title available?)
This page was built for publication: Digital trees and memoryless sources: from arithmetics to analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2959908)
