Better Space Bounds for Parameterized Range Majority and Minority

DOI10.1007/978-3-642-40104-6_11zbMath1391.68046arXiv1210.1765OpenAlexW2119651521MaRDI QIDQ2842150

Travis Gagie, Djamal Belazzougui, Gonzalo Navarro

Publication date: 12 August 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.1765

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Algorithms on strings (68W32)

Related Items (8)

Optimal encodings for range majority queries ⋮ Dynamic range majority data structures ⋮ Compressed dynamic range majority and minority data structures ⋮ Unnamed Item ⋮ Range majorities and minorities in arrays ⋮ Tree path majority data structures ⋮ Array Range Queries ⋮ Linear-space data structures for range frequency queries on arrays and trees

This page was built for publication: Better Space Bounds for Parameterized Range Majority and Minority