Linear-space data structures for range minority query in arrays
From MaRDI portal
Publication:494786
DOI10.1007/s00453-014-9881-9zbMath1319.68063OpenAlexW2155992938MaRDI QIDQ494786
Stephane Durocher, Timothy M. Chan, Matthew Skala, Bryan T. Wilkinson
Publication date: 2 September 2015
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-014-9881-9
Related Items (4)
Compressed dynamic range majority and minority data structures ⋮ Improved Time and Space Bounds for Dynamic Range Mode ⋮ Range majorities and minorities in arrays ⋮ Tree path majority data structures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Towards optimal range medians
- Range mode and range median queries in constant time and sub-quadratic space
- Making data structures persistent
- A simple linear-space data structure for constant-time range minimum query
- Linear-Space Data Structures for Range Minority Query in Arrays
- Range Majority in Constant Time and Linear Space
- Dynamic Range Majority Data Structures
- Cell Probe Lower Bounds and Approximations for Range Mode
- On Cartesian Trees and Range Minimum Queries
- Filtering Search: A New Approach to Query-Answering
- Improved Bounds for Range Mode and Range Median Queries
- STACS 2005
This page was built for publication: Linear-space data structures for range minority query in arrays
