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

Paweł Gawrychowski, Shay Mozes, Oren Weimann

Research output: Contribution to journalArticlepeer-review


We present an optimal data structure for submatrix maximum queries in n× n Monge matrices. Our result is a two-way reduction showing that the problem is equivalent to the classical predecessor problem in a universe of polynomial size. This gives a data structure of O(n) space that answers submatrix maximum queries in O(log log n) time, as well as a matching lower bound, showing that O(log log n) query-time is optimal for any data structure of size O(npolylog(n)). Our result settles the problem, improving on the O(log2 n) query time in SODA'12, and on the O(log n) query-time in ICALP'14. In addition, we show that partial Monge matrices can be handled in the same bounds as full Monge matrices. In both previous results, partial Monge matrices incurred additional inverse-Ackermann factors.

Original languageEnglish
Article number16
JournalACM Transactions on Algorithms
Issue number2
StatePublished - Apr 2020

Bibliographical note

Funding Information:
This article is based on two extended abstracts that appeared in ICALP 2014 [17] and ICALP 2015 [18]. S. Mozes and O. Weimann were supported in part by Israel Science Foundation grants 794/13 and 592/17. Authors’ addresses: P. Gawrychowski, Institute of Computer Science, University of Wrocław, Poland; email:; S. Mozes, School of Computer Science, Interdisciplinary Center Herzliya, Israel; email:; O. Weimann, Department of Computer Science, University of Haifa, Israel; email: Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from © 2020 Copyright held by the owner/author(s). Publication rights licensed to ACM. 1549-6325/2020/03-ART16 $15.00

Publisher Copyright:
© 2020 ACM.


  • Monge matrix
  • predecessor search
  • range queries

ASJC Scopus subject areas

  • Mathematics (miscellaneous)


Dive into the research topics of 'Submatrix Maximum Queries in Monge and Partial Monge Matrices Are Equivalent to Predecessor Search'. Together they form a unique fingerprint.

Cite this