For any κ in [1, log log n], an m×n array admits an O(κ mn (log m + log log n))-bit 2D-RMQ encoding with O(log^{1/κ} n) query time.
Simultaneous encodings for range and next/previous larger/smaller value queries.Theor
1 Pith paper cite this work, alongside 4 external citations. Polarity classification is still indexing.
1
Pith paper citing it
4
external citations · OpenAlex
fields
cs.DS 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries
For any κ in [1, log log n], an m×n array admits an O(κ mn (log m + log log n))-bit 2D-RMQ encoding with O(log^{1/κ} n) query time.