Submatrix Maximum Queries in Monge and Partial Monge Matrices Are Equivalent to Predecessor Search

Pawel Gawrychowski, Shay Mozes, Oren Weimann. Submatrix Maximum Queries in Monge and Partial Monge Matrices Are Equivalent to Predecessor Search. ACM Transactions on Algorithms, 16(2), 2020. [doi]

@article{GawrychowskiMW20,
  title = {Submatrix Maximum Queries in Monge and Partial Monge Matrices Are Equivalent to Predecessor Search},
  author = {Pawel Gawrychowski and Shay Mozes and Oren Weimann},
  year = {2020},
  doi = {10.1145/3381416},
  url = {https://doi.org/10.1145/3381416},
  researchr = {https://researchr.org/publication/GawrychowskiMW20},
  cites = {0},
  citedby = {0},
  journal = {ACM Transactions on Algorithms},
  volume = {16},
  number = {2},
}