m‐ary Search trees when m ≥ 27: A strong asymptotics for the space requirements

DOI10.1002/RSA.10108zbMATH Open1037.60027OpenAlexW2039359759MaRDI QIDQ4459586FDOQ4459586

Authors: Brigitte Chauvin, Nicolas Pouyanne 

Publication date: 29 March 2004

Published in: Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.10108

Recommendations

• Transfer theorems and asymptotic distributional results for m‐ary search trees
• On the height of random m‐ary search trees
• Support and density of the limit \(m\)-ary search trees distribution
• scientific article; zbMATH DE number 2159649
• The Number of m-ary Search Trees on n Keys

zbMATH Keywords

search trees

Mathematics Subject Classification ID

Strong limit theorems (60F15)

Cites Work

• Title not available (Why is that?)

Cited In (21)

• A repertoire for additive functionals of uniformly distributed \(m\)-ary search trees
• The total path length of split trees
• An application of $m$-ary trees to the design of data structures for geometric searching problems
• Second phase changes in random \(m\)-ary search trees and generalized quicksort: Convergence rates
• Paths in \(m\)-ary interval trees
• Solutions to complex smoothing equations
• Phase transition in a generalized Eden growth model on a tree
• Degree profile of \(m\)-ary search trees: a vehicle for data structure compression
• Limit distributions for large Pólya urns
• Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees
• Functional limit theorems for multitype branching processes and generalized Pólya urns.
• Inversions in split trees and conditional Galton-Watson trees
• Title not available (Why is that?)
• Dependence and phase changes in random \(m\)-ary search trees
• Phase changes in random \(m\)-ary search trees and generalized quicksort
• An algebraic approach to Pólya processes
• Balanced multicolour Pólya urns via smoothing systems analysis
• On the average internal path length of m-ary search trees
• Refined asymptotics for the number of leaves of random point quadtrees
• The size of random fragmentation trees
• Limit distributions for multitype branching processes of \(m\)-ary search trees

This page was built for publication: m‐ary Search trees when m ≥ 27: A strong asymptotics for the space requirements

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