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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
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
Is this relevant?
2016
2016
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
Is this relevant?
2013
2013
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
Is this relevant?
2012
2012
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
Is this relevant?
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… Expand
  • table 1.1
  • figure 3.1
  • table 3.1
  • figure 3.3
  • figure 3.4
Is this relevant?
Highly Cited
2010
Highly Cited
2010
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
Is this relevant?
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… Expand
Is this relevant?
2009
2009
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
Is this relevant?
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… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Abstract A radial point interpolation meshless (or radial PIM) method was proposed by authors to overcome the possible… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?