Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Range minimum query

Known as: RMQ, Range min query 
In computer science, a range minimum query (RMQ) solves the problem of finding the minimal value in a sub-array of an array of comparable objects… Expand
Wikipedia

Related topics

Related topics

7 relations
Cartesian treeDynamic programmingGraph isomorphismLCP array
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Lower bound for succinct range minimum query
Given an integer array A[1..n], the Range Minimum Query problem (RMQ) asks to preprocess A into a data structure, supporting RMQ… Expand
2018
2018
Faster range minimum queries
Range minimum query is an important building brick of many compressed data structures and string matching algorithms. Although… Expand
2016
2016
Improved Range Minimum Queries
Fischer and Heun [SICOMP 2011] proposed the first Range Minimum Query (RMQ) data structure on an array A[1, n] that uses 2n + o(n… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2016
2016
Efficient dynamic range minimum query
The Range Minimum Query problem consists in answering efficiently the simple question: "what is the minimal element between two… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • table 2
2013
2013
On (Dynamic) Range Minimum Queries in External Memory
We study the one-dimensional range minimum query (RMQ) problem in the external memory model. We provide the first space-optimal… Expand
  • figure 1
  • figure 2
  • figure 3
2012
2012
On Cartesian Trees and Range Minimum Queries
We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a… Expand
  • table 1
  • figure 1
Highly Cited
2011
Highly Cited
2011
Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
Given a static array of $n$ totally ordered objects, the range minimum query problem is to build a data structure that allows us… Expand
  • table 1.1
  • figure 3.1
  • table 3.1
  • figure 3.3
  • figure 3.4
Highly Cited
2010
Highly Cited
2010
Optimal Succinctness for Range Minimum Queries
For a static array A of n totally ordered objects, a range minimum query asks for the position of the minimum between two… Expand
  • table 1
Highly Cited
2010
Highly Cited
2010
Data structures for range minimum queries in multidimensional arrays
Given a d-dimensional array A with N entries, the Range Minimum Query (RMQ) asks for the minimum element within a contiguous… Expand
2007
2007
Two-Dimensional Range Minimum Queries
We consider the two-dimensional Range Minimum Query problem: for a static (m × n)-matrix of size N = mn which may be preprocessed… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE