Cell Probe Lower Bounds and Approximations for Range Mode

DOI10.1007/978-3-642-14165-2_51zbMath1288.68046OpenAlexW1550061821MaRDI QIDQ3587412

Kasper Dalgaard Larsen, Jakob Truelsen, Allan Grønlund Jørgensen, Mark Greve

Publication date: 7 September 2010

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14165-2_51

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)

Related Items

Optimal encodings for range majority queries ⋮ Compressed dynamic range majority and minority data structures ⋮ Colored range queries and document retrieval ⋮ Linear-space data structures for range minority query in arrays ⋮ Improved Time and Space Bounds for Dynamic Range Mode ⋮ Range Majority in Constant Time and Linear Space ⋮ Enumerating Range Modes ⋮ Linear-space data structures for range mode query in arrays ⋮ Spaces, Trees, and Colors ⋮ Range majorities and minorities in arrays ⋮ Array Range Queries ⋮ Low space data structures for geometric range mode query

This page was built for publication: Cell Probe Lower Bounds and Approximations for Range Mode