Near-optimal RMQ encodings for bounded alphabets achieve space close to the general case in 1D and 2D with efficient queries.
On space efficient two dimensional range minimum data structures.Algorithmica, 63(4):815–830, 2012
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Encodings for Range Minimum Queries over Bounded Alphabets
Near-optimal RMQ encodings for bounded alphabets achieve space close to the general case in 1D and 2D with efficient queries.