Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Given an integer array A[1..n], the Range Minimum Query problem (RMQ) asks to preprocess A into a data structure, supporting RMQ… 
2017
2017
Range minimum query is an important building brick of many compressed data structures and string matching algorithms. Although… 
Highly Cited
2013
Highly Cited
2013
The suffix tree is an extremely important data structure in bioinformatics. Classical implementations require much space, which… 
2013
2013
We study the one-dimensional range minimum query (RMQ) problem in the external memory model. We provide the first space-optimal… 
Highly Cited
2011
Highly Cited
2011
Given a static array of $n$ totally ordered objects, the range minimum query problem is to build a data structure that allows us… 
Highly Cited
2010
Highly Cited
2010
Given a d-dimensional array A with N entries, the Range Minimum Query (RMQ) asks for the minimum element within a contiguous… 
Highly Cited
2009
Highly Cited
2009
We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a… 
Highly Cited
2008
Highly Cited
2008
For a static array A of n totally ordered objects, a range minimum query asks for the position of the minimum between two… 
2007
2007
We consider the two-dimensional Range Minimum Query problem: for a static (m × n)-matrix of size N = mn which may be preprocessed…