Linear-space data structures for range minority query in arrays
From MaRDI portal
Publication:2904565
DOI10.1007/978-3-642-31155-0_26zbMATH Open1318.68068OpenAlexW2236111098MaRDI QIDQ2904565FDOQ2904565
Authors: 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
Recommendations
- Linear-space data structures for range minority query in arrays
- Linear-space data structures for range frequency queries on arrays and trees
- Linear-space data structures for range frequency queries on arrays and trees
- Range majority in constant time and linear space
- Range Majority in Constant Time and Linear Space
Cited In (14)
- Linear-space data structures for range frequency queries on arrays and trees
- Linear-space data structures for range frequency queries on arrays and trees
- Optimal encodings for range majority queries
- A linear-space data structure for range-LCP queries in poly-logarithmic time
- On hardness of several string indexing problems
- Dynamic range majority data structures
- Array range queries
- On space efficient two dimensional range minimum data structures
- Range majority in constant time and linear space
- Linear-space data structures for range mode query in arrays
- Low space data structures for geometric range mode query
- Bottom-\(k\) document retrieval
- Range Majority in Constant Time and Linear Space
- Linear-space data structures for range minority query in arrays
This page was built for publication: Linear-space data structures for range minority query in arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904565)
