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)

Related topics

Related topics

7 relations
Cartesian treeDynamic programmingGraph isomorphismLCP array

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… 
2018
2018
Faster range minimum queries
Range minimum query is an important building brick of many compressed data structures and string matching algorithms. Although… 
2015
2015
Efficacy and safety of acupuncture for the treatment of non-specific acute low back pain : a randomised controlled multicentre trial protocol [ ISRCTN 65814467 ]
Background: Low back pain and its associated incapacitating effects constitute an important healthcare and socioeconomic problem… 
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… 
Highly Cited
2012
Highly Cited
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… 
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… 
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… 
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… 
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… 
2007
2007
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers
The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I)???11/9OPT(I)?+?6/9.- Sequential Vector Packing.- A… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)