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… 
2017
2017
Faster range minimum queries
Range minimum query is an important building brick of many compressed data structures and string matching algorithms. Although… 
2015
2015
Efficient Range Minimum Queries using Binary Indexed Trees
We present new results on Binary Indexed Trees in order to efficiently solve Range Minimum Queries. We introduce a way of using… 
2014
2014
Study of the interaction between glucosamine hydrochloride and sodium dodecylsulphate micelles using conductometric, isothermal calorimetry, zeta-potential titrations, and NMR NOESY
The aim of this work was to investigate the influence of an anti-inflammatory agent, the bulky counterion named glucosamine (Gl… 
2013
2013
THE ASSOCIATION BETWEEN RADIOGRAPHIC FEATURES IN PATIENTS WITH LUMBAR SPINE DEGENERATIVE CHANGES AND BODY MASS INDEX; A PRELIMINARY STEREOLOGICAL STUDY
Objective: To evaluate the association between radiographic features (osteophytes, disc space narrowing) in patients with lumbar… 
2009
2009
MATRIX-BASED LOGIC FOR APPLICATION IN PHYSICS
The paper offers a matrix-based logic (relevant matrix quantum physics) for propositions which seems suitable as an underlying… 
2008
2008
Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries
The Range Minimum Query (RMQ) Problem is to preprocess an array A of length n in 0(n) time such that subsequent on-line queries… 
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… 
2006
2006
Application of radial basis functions to linear and nonlinear structural analysis problems
2004
2004
Compositional Nutrient Diagnosis In Nopal (Opuntia ficus-indica) ♦
The appraisal of soil fertility and the assessment of plant mineral requirements are fundamental for crop management. This study… 
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)