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)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Szymon Grabowski, Tomasz Marek Kowalski
- Stringology
- 2017

Range Minimum Query (RMQ) is an important building brick of many compressed data structures and string matching algorithmsâ€¦Â (More)

Is this relevant?

Review

2017

Review

2017

- Niklas Baumstark, Simon Gog, Tobias Heuer, Julian Labeit
- SEA
- 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)

Is this relevant?

2016

2016

- Hector Ferrada, Gonzalo Navarro
- 2016 Data Compression Conference (DCC)
- 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)

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)

Is this relevant?

2013

2013

- Lars Arge, Johannes Fischer, Peter Sanders, Nodari Sitchinava
- WADS
- 2013

We study the one-dimensional range minimum query (RMQ) problem in the external memory model. We provide the first spaceoptimalâ€¦Â (More)

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

- Johannes Fischer, Volker Heun
- SIAM J. Comput.
- 2011

Given a static array of n totally ordered object, the range minimum query problem is to build an additional data structure thatâ€¦Â (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- Johannes Fischer
- LATIN
- 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)

Is this relevant?

2009

2009

- Erik D. Demaine, Gad M. Landau, Oren Weimann
- Algorithmica
- 2009

We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce aâ€¦Â (More)

Is this relevant?

2007

2007

- Amihood Amir, Johannes Fischer, Moshe Lewenstein
- CPM
- 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)

Is this relevant?