On the expected cost of partial match queries in random quad-\(K\)-d trees
From MaRDI portal
Publication:6130360
DOI10.1007/s44007-024-00090-5MaRDI QIDQ6130360
Publication date: 2 April 2024
Published in: La Matematica (Search for Journal in Brave)
analysis of algorithmsquadtreesmultidimensional searchpartial match queriesassociative queries\(K\)-d trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the cost of fixed partial match queries in \(K\)-d trees
- A limit process for partial match queries in random quadtrees and 2-d trees
- Mellin transforms and asymptotics: Finite differences and Rice's integrals
- Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees
- Partial match queries in relaxed multidimensional search trees
- Squarish k-d Trees
- Random Partial Match in Quad-K-d Trees
- Selection by rank inK-dimensional binary search trees
- Partial match queries in two-dimensional quadtrees: a probabilistic approach
- Improved master theorems for divide-and-conquer recurrences
- Multidimensional binary search trees used for associative searching
- Notes on the Binomial Transform
- Partial Match Queries in Random Quadtrees
- On the average performance of orthogonal range search in multidimensional data structures
- Fixed Partial Match Queries in Quadtrees
- Partial match retrieval of multidimensional data
- Quad-K-d Trees
- Partial Match Queries in Random k-d Trees
