Data Structures for Approximate Orthogonal Range Counting

DOI10.1007/978-3-642-10631-6_20zbMath1272.68120OpenAlexW1555668690MaRDI QIDQ3652204

Yakov Nekrich

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_20

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (4)

Dynamic range majority data structures ⋮ Efficient range searching for categorical and plain data ⋮ Optimal deterministic shallow cuttings for 3-d dominance ranges ⋮ Unnamed Item

This page was built for publication: Data Structures for Approximate Orthogonal Range Counting