Refined asymptotics for the number of leaves of random point quadtrees
From MaRDI portal
Publication:4993545
Recommendations
Cites work
- scientific article; zbMATH DE number 5081212 (Why is no real title available?)
- m‐ary Search trees when m ≥ 27: A strong asymptotics for the space requirements
- A note on the Quicksort asymptotics
- Analysis of the space of search trees under the random insertion algorithm
- Dependence and phase changes in random \(m\)-ary search trees
- Functional limit theorems for multitype branching processes and generalized Pólya urns.
- Hypergeometrics and the cost structure of quadtrees
- Limit laws for local counters in random binary search trees
- Mellin transforms and asymptotics: Finite differences and Rice's integrals
- Phase changes in random \(m\)-ary search trees and generalized quicksort
- Phase changes in random point quadtrees
- Refined quicksort asymptotics
- The CLT analogue for cyclic urns
- The Joint Distribution of Elastic Buckets in Multiway Search Trees
Cited in
(2)
This page was built for publication: Refined asymptotics for the number of leaves of random point quadtrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4993545)