The random multisection problem, travelling waves and the distribution of the height of \(m\)-ary search trees
From MaRDI portal
Publication:866959
DOI10.1007/s00453-006-0107-7zbMath1117.68095OpenAlexW2001555908MaRDI QIDQ866959
Brigitte Chauvin, Michael Drmota
Publication date: 14 February 2007
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-006-0107-7
intersection propertyheight of search treesinequalities between distribution functionsrandom multisection problem
Analysis of algorithms (68W40) Searching and sorting (68P10) Combinatorial probability (60C05) Data structures (68P05)
Related Items (12)
Longest Path Distance in Random Circuits ⋮ Convergence of directed random graphs to the Poisson-weighted infinite tree ⋮ Quenched invariance principles for the maximal particle in branching random walk in random environment and the parabolic Anderson model ⋮ Poisson-Dirichlet branching random walks ⋮ Contributions to uniformly distributed functions. I: Discrepancy of fractal sets ⋮ The height of increasing trees ⋮ A functional limit theorem for the profile of search trees ⋮ On Robson's convergence and boundedness conjectures concerning the height of binary search trees ⋮ Minima in branching random walks ⋮ Tightness for a family of recursion equations ⋮ Tightness for the minimal displacement of branching random walk ⋮ On longest paths and diameter in random apollonian networks
This page was built for publication: The random multisection problem, travelling waves and the distribution of the height of \(m\)-ary search trees