m‐ary Search trees when m ≥ 27: A strong asymptotics for the space requirements
From MaRDI portal
Publication:4459586
DOI10.1002/rsa.10108zbMath1037.60027OpenAlexW2039359759MaRDI QIDQ4459586
Nicolas Pouyanne, Brigitte Chauvin
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
Related Items (14)
Solutions to complex smoothing equations ⋮ Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees ⋮ Phase transition in a generalized Eden growth model on a tree ⋮ Unnamed Item ⋮ DEGREE PROFILE OF m-ARY SEARCH TREES: A VEHICLE FOR DATA STRUCTURE COMPRESSION ⋮ Limit distributions for large Pólya urns ⋮ Limit distributions for multitype branching processes of \(m\)-ary search trees ⋮ The size of random fragmentation trees ⋮ The total path length of split trees ⋮ Dependence and phase changes in random m‐ary search trees ⋮ An algebraic approach to Pólya processes ⋮ Inversions in Split Trees and Conditional Galton–Watson Trees ⋮ Functional limit theorems for multitype branching processes and generalized Pólya urns. ⋮ Unnamed Item
Cites Work
This page was built for publication: m‐ary Search trees when m ≥ 27: A strong asymptotics for the space requirements
