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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2006-2018
0520062018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Range Minimum Query (RMQ) is an important building brick of many compressed data structures and string matching algorithms… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Review
2017
Review
2017
Finding the position of the minimal element in a subarray A[i..j] of an array A of size n is a fundamental operation in many… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2015
2015
We present new results on Binary Indexed Trees in order to efficiently solve Range Minimum Queries. We introduce a way of using… (More)
  • figure 2.1
  • figure 2.2
  • table 1
Is this relevant?
2013
2013
We study the one-dimensional range minimum query (RMQ) problem in the external memory model. We provide the first spaceoptimal… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2012
2012
In this lecture, we look at various data structures to solve problems about static trees: given a static tree, we perform some… (More)
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Given a static array of n totally ordered object, the range minimum query problem is to build an additional data structure that… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
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… (More)
  • table 1
  • figure 1
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… (More)
  • 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… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?