Submatrix maximum queries in monge and partial monge matrices are equivalent to predecessor search.ACM Trans

Pawel Gawrychowski, Shay Mozes, Oren Weimann · 2020 · ACM Transactions on Algorithms · DOI 10.1145/3381416

1 Pith paper cite this work, alongside 2 external citations. Polarity classification is still indexing.

1 Pith paper citing it

2 external citations · OpenAlex

open at publisher browse 1 citing papers

representative citing papers

cs.DS · 2026-07-05 · accept · novelty 7.0

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.

Showing 1 of 1 citing paper.

Near-Optimal and Efficient Encoding for Two-Dimensional Range Minimum Queries cs.DS · 2026-07-05 · accept · none · ref 25
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.