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.68095MaRDI 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 property; height of search trees; inequalities between distribution functions; random multisection problem
68W40: Analysis of algorithms
68P10: Searching and sorting
60C05: Combinatorial probability
68P05: Data structures
Related Items
Tightness for the minimal displacement of branching random walk, On longest paths and diameter in random apollonian networks, The height of increasing trees, On Robson's convergence and boundedness conjectures concerning the height of binary search trees, Tightness for a family of recursion equations, Contributions to uniformly distributed functions. I: Discrepancy of fractal sets, Poisson-Dirichlet branching random walks, Quenched invariance principles for the maximal particle in branching random walk in random environment and the parabolic Anderson model, Minima in branching random walks, A functional limit theorem for the profile of search trees, Longest Path Distance in Random Circuits, Convergence of directed random graphs to the Poisson-weighted infinite tree
