A repertoire for additive functionals of uniformly distributed m-ary search trees

zbMATH Open1104.68030arXivmath/0502422MaRDI QIDQ5485337FDOQ5485337

Authors: James Allen Fill, Nevin Kapur 

Publication date: 29 August 2006

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

Recommendations

• Transfer theorems and asymptotic distributional results for m‐ary search trees
• Limiting distributions for additive functionals on Catalan trees
• scientific article; zbMATH DE number 2159649
• m‐ary Search trees when m ≥ 27: A strong asymptotics for the space requirements
• A functional limit theorem for the profile of search trees

zbMATH Keywords

method of momentsadditive functionalssingularity analysislimit lawsleavesHadamard productssearch treesshape functionalspace requirement

Mathematics Subject Classification ID

Data structures (68P05)

Cited In (6)

• Support and density of the limit \(m\)-ary search trees distribution
• Cost functionals for large (uniform and simply generated) random trees
• Transfer theorems and asymptotic distributional results for m‐ary search trees
• Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees
• Title not available (Why is that?)
• On the average internal path length of m-ary search trees

This page was built for publication: A repertoire for additive functionals of uniformly distributed \(m\)-ary search trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5485337)