Partial Match Queries in Random Quadtrees
From MaRDI portal
Recommendations
- Partial match queries in random quadtrees
- Random partial match in quad-K-d trees
- Partial Match Queries in Random k-d Trees
- Partial match queries in two-dimensional quadtrees: a probabilistic approach
- Fixed partial match queries in quadtrees
- Strong convergence of partial match queries in random quadtrees
- A limit process for partial match queries in random quadtrees and 2-d trees
- Limit laws for partial match queries in quadtrees
- Partial match queries in relaxed multidimensional search trees
Cited in
(13)- On the expected cost of partial match queries in random quad-K-d trees
- The dual tree of a recursive triangulation of the disk
- Fixed partial match queries in quadtrees
- Partial match queries in random quadtrees
- Limit laws for partial match queries in quadtrees
- Strong convergence of partial match queries in random quadtrees
- A limit process for partial match queries in random quadtrees and 2-d trees
- On a functional contraction method
- Partial Match Queries in Random k-d Trees
- A limit field for orthogonal range searches in two-dimensional random point search trees
- Expected worst-case partial match in random quadtries
- Psi-series method for equality of random trees and quadratic convolution recurrences
- Partial match queries in two-dimensional quadtrees: a probabilistic approach
This page was built for publication: Partial Match Queries in Random Quadtrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4706238)
