Partial match queries in two-dimensional quadtrees: a probabilistic approach
From MaRDI portal
Publication:2996575
DOI10.1239/aap/1300198518zbMath1215.68083arXiv1009.3113MaRDI QIDQ2996575
Publication date: 3 May 2011
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1009.3113
Discrete-time Markov processes on general state spaces (60J05) Data structures (68P05) Limit theorems in probability theory (60F99)
Related Items
On the cost of fixed partial match queries in \(K\)-d trees ⋮ Strong Convergence of Partial Match Queries in Random Quadtrees ⋮ A limit process for partial match queries in random quadtrees and 2-d trees ⋮ On the expected cost of partial match queries in random quad-\(K\)-d trees ⋮ Fixed Partial Match Queries in Quadtrees ⋮ A limit field for orthogonal range searches in two-dimensional random point search trees ⋮ Partial match queries in random quadtrees ⋮ The dual tree of a recursive triangulation of the disk ⋮ Psi-series method for equality of random trees and quadratic convolution recurrences ⋮ On a functional contraction method ⋮ Selection by rank inK-dimensional binary search trees
Cites Work
- Unnamed Item
- Random recursive triangulations of the disk via fragmentation theory
- Analytic variations on quadtrees
- Integro-differential equations and generalized hypergeometric functions
- Quad trees: A data structure for retrieval by composite keys
- Asymptotic properties and absolute continuity of laws stable by random weighted mean.
- Asymptotic laws for nonconservative self-similar fragmentations
- Markov Chains and Stochastic Stability
- Sur Une Équation Fonctionnelle Et SES Applications: Une Extension Du Théorème De Kesten-Stigum Concernant Des Processus De Branchement
- Partial Match Queries in Random Quadtrees
- Hypergeometrics and the cost structure of quadtrees
- Random Fragmentation and Coagulation Processes
