Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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… Expand

2018

2018

Range minimum query is an important building brick of many compressed data structures and string matching algorithms. Although… Expand

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

2016

2016

The Range Minimum Query problem consists in answering efficiently the simple question: "what is the minimal element between two… Expand

2013

2013

We study the one-dimensional range minimum query (RMQ) problem in the external memory model. We provide the first space-optimal… Expand

2012

2012

We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a… Expand

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

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

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

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