Data structures for approximate orthogonal range counting

DOI10.1007/978-3-642-10631-6_20MaRDI QIDQ3652204zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Adaptive and approximate orthogonal range counting
• Adaptive and approximate orthogonal range counting
• The space complexity of 2-dimensional approximate range counting
• Tight space bounds for two-dimensional approximate range counting
• Range counting over multidimensional data streams

Cited in

(15)

• Efficient range searching for categorical and plain data
• Range counting over multidimensional data streams
• Range counting over multidimensional data streams
• Optimal deterministic shallow cuttings for 3-d dominance ranges
• Dynamic range majority data structures
• Tight space bounds for two-dimensional approximate range counting
• Adaptive and approximate orthogonal range counting
• scientific article; zbMATH DE number 7561469 (Why is no real title available?)
• The space complexity of 2-dimensional approximate range counting
• On approximate range counting and depth
• Adaptive and approximate orthogonal range counting
• scientific article; zbMATH DE number 6297698 (Why is no real title available?)
• scientific article; zbMATH DE number 7740901 (Why is no real title available?)
• Approximate range counting revisited
• Space Efficient Data Structures for Dynamic Orthogonal Range Counting

This page was built for publication: Data structures for approximate orthogonal range counting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3652204)