Linear-Space Data Structures for Range Minority Query in Arrays
From MaRDI portal
Publication:2904565
DOI10.1007/978-3-642-31155-0_26zbMath1318.68068OpenAlexW2236111098MaRDI QIDQ2904565
Timothy M. Chan, Stephane Durocher, Matthew Skala, Bryan T. Wilkinson
Publication date: 14 August 2012
Published in: Algorithm Theory – SWAT 2012 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-31155-0_26
Related Items
Optimal encodings for range majority queries ⋮ Dynamic range majority data structures ⋮ Linear-space data structures for range minority query in arrays ⋮ Linear-space data structures for range mode query in arrays ⋮ Array Range Queries ⋮ On hardness of several string indexing problems ⋮ Bottom-\(k\) document retrieval ⋮ Low space data structures for geometric range mode query ⋮ Linear-space data structures for range frequency queries on arrays and trees