m‐ary Search trees when m ≥ 27: A strong asymptotics for the space requirements
From MaRDI portal
Publication:4459586
Recommendations
Cited in
(21)- On the average internal path length of m-ary search trees
- Inversions in split trees and conditional Galton-Watson trees
- Refined asymptotics for the number of leaves of random point quadtrees
- An algebraic approach to Pólya processes
- The size of random fragmentation trees
- A repertoire for additive functionals of uniformly distributed \(m\)-ary search trees
- Degree profile of \(m\)-ary search trees: a vehicle for data structure compression
- Phase transition in a generalized Eden growth model on a tree
- Phase changes in random \(m\)-ary search trees and generalized quicksort
- Paths in \(m\)-ary interval trees
- Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees
- The total path length of split trees
- Solutions to complex smoothing equations
- scientific article; zbMATH DE number 2159649 (Why is no real title available?)
- Balanced multicolour Pólya urns via smoothing systems analysis
- Limit distributions for multitype branching processes of \(m\)-ary search trees
- Functional limit theorems for multitype branching processes and generalized Pólya urns.
- 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
- Dependence and phase changes in random \(m\)-ary search trees
- Limit distributions for large Pólya urns
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)
