Partial match queries in relaxed multidimensional search trees
From MaRDI portal
Publication:1840511
zbMath0967.68054MaRDI QIDQ1840511
Conrado Martínez, Alois Panholzer, Prodinger, Helmut
Publication date: 3 September 2001
Published in: Algorithmica (Search for Journal in Brave)
Related Items (12)
Limit laws for partial match queries in quadtrees ⋮ Reductions in binary search trees ⋮ 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 ⋮ Interview with Helmut Prodinger ⋮ On the expected cost of partial match queries in random quad-\(K\)-d trees ⋮ Median and hybrid median \(K\)-dimensional trees ⋮ Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees ⋮ Weighted height of random trees ⋮ Partial match queries in random quadtrees ⋮ Psi-series method for equality of random trees and quadratic convolution recurrences ⋮ Selection by rank inK-dimensional binary search trees
This page was built for publication: Partial match queries in relaxed multidimensional search trees
