Dynamic range majority data structures
From MaRDI portal
Publication:306716
DOI10.1016/j.tcs.2016.07.039zbMath1350.68068OpenAlexW2485167870MaRDI QIDQ306716
Amr Elmasry, J. Ian Munro, Meng He, Patrick K. Nicholson
Publication date: 1 September 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.07.039
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items
Compressed dynamic range majority and minority data structures ⋮ Range majorities and minorities in arrays
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multidimensional divide-and-conquer
- Space-efficient data-analysis queries on grids
- Approximate colored range and point enclosure queries
- Finding repeated elements
- Fusion trees can be implemented with \(AC^0\) instructions only
- Surpassing the information theoretic bound with fusion trees
- Time bounds for selection
- The nearest common ancestor in a dynamic tree
- Range majority in constant time and linear space
- Better Space Bounds for Parameterized Range Majority and Minority
- Array Range Queries
- Linear-Space Data Structures for Range Minority Query in Arrays
- Indexing for summary queries
- Counting Colours in Compressed Strings
- Range Majority in Constant Time and Linear Space
- Dynamic Range Majority Data Structures
- Dynamic Range Selection in Linear Space
- Space-Efficient Data-Analysis Queries on Grids
- Dynamic ordered sets with exponential search trees
- Data Structures for Approximate Orthogonal Range Counting
- Optimal External Memory Interval Management
- New Lower Bound Techniques for Dynamic Partial Sums and Related Problems
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
- Optimal Dynamic Sequence Representations
