Enumerating Range Modes
From MaRDI portal
Publication:6065431
DOI10.4230/lipics.isaac.2020.29arXiv1907.10984OpenAlexW3114207832MaRDI QIDQ6065431
Kunihiko Sadakane, Kentaro Sumigawa, Sankardeep Chakraborty, Srinivasa Rao Satti
Publication date: 14 November 2023
Full work available at URL: https://arxiv.org/abs/1907.10984
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Range mode and range median queries in constant time and sub-quadratic space
- Log-logarithmic worst-case range queries are possible in space theta(N)
- Linear-space data structures for range mode query in arrays
- Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
- Cell Probe Lower Bounds and Approximations for Range Mode
- Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
- Truly Subcubic Min-Plus Product for Less Structured Matrices, with Applications
- Improved Bounds for Range Mode and Range Median Queries
This page was built for publication: Enumerating Range Modes
