Asymptotic normality for the size of graph tries built from M-ary tree labelings

DOI10.1016/j.tcs.2023.114011arXiv2101.09871OpenAlexW3123191161MaRDI QIDQ6132968

Tsan-Cheng Yu, Michael Fuchs

Publication date: 21 July 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2101.09871

zbMATH Keywords

central limit theoremmethod of momentstriesspace requirementgraph tries

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A general central limit theorem for shape parameters of \(m\)-ary tries and PATRICIA tries
• Mellin transforms and asymptotics: Harmonic sums
• On the variance of a class of inductive valuations of data structures for digital search
• Analytical depoissonization and its applications
• A general limit theorem for recursive algorithms and combinatorial structures
• Process convergence for the complexity of radix selection on Markov sources
• An analytic approach to the asymptotic variance of trie statistics and related structures
• Hidden word statistics
• A multivariate view of random bucket digital search trees
• Variance of Size in Regular Graph Tries

This page was built for publication: Asymptotic normality for the size of graph tries built from M-ary tree labelings