Add to ORKGThe Range Minimum Query problem consists in answering efficiently the simple question: “what is the minimal element between two specified indices of a given array?”. In this paper we present a novel structure that offers a trade-off between time and space. Moreover we show how the structure can be easily maintained whenever an insertion, modification or deletion modifies the input sequence
A mode of a multiset S is an element a ∈ S of maximum multiplicity; that is, a occurs at least as fr...
A data base is said to allow range restrictions if we may request that only records with some specif...
The problem of parameterized range majority asks us to preprocess a string of length n such that, gi...
International audienceThe Range Minimum Query problem consists in answering efficiently to a simple ...
We consider the problem of encoding range minimum queries (RMQs): given an array A[1..n] of distinct...
Abstract. We revisit the range minimum query problem and present a new O(n)-space data structure tha...
We consider the problem of encoding range minimum queries (RMQs): given an array A[1..n] of distinct...
Range minimum queries (RMQs) are essential in many algorithmic procedures. The problem is to prepare...
The Range-Minimum-Query-Problem is to preprocess an array of length n in O(n) time such that all sub...
Finding the position of the minimal element in a subarray A[i..j] of an array A of size n is a funda...
Abstract. The Range Minimum Query (RMQ) Problem is to preprocess an array A of length n in O(n) time...
Given an array A of n elements, we wish to support queries for the most frequent and least frequent ...
For any epsilon in (0,1), a (1+epsilon)-approximate range mode query asks for the position of an ele...
Abstract. In this paper we consider various encoding problems for range queries on arrays. In these ...
We consider range queries that search for low-frequency elements (least frequent elements and α-mino...
A mode of a multiset S is an element a ∈ S of maximum multiplicity; that is, a occurs at least as fr...
A data base is said to allow range restrictions if we may request that only records with some specif...
The problem of parameterized range majority asks us to preprocess a string of length n such that, gi...
International audienceThe Range Minimum Query problem consists in answering efficiently to a simple ...
We consider the problem of encoding range minimum queries (RMQs): given an array A[1..n] of distinct...
Abstract. We revisit the range minimum query problem and present a new O(n)-space data structure tha...
We consider the problem of encoding range minimum queries (RMQs): given an array A[1..n] of distinct...
Range minimum queries (RMQs) are essential in many algorithmic procedures. The problem is to prepare...
The Range-Minimum-Query-Problem is to preprocess an array of length n in O(n) time such that all sub...
Finding the position of the minimal element in a subarray A[i..j] of an array A of size n is a funda...
Abstract. The Range Minimum Query (RMQ) Problem is to preprocess an array A of length n in O(n) time...
Given an array A of n elements, we wish to support queries for the most frequent and least frequent ...
For any epsilon in (0,1), a (1+epsilon)-approximate range mode query asks for the position of an ele...
Abstract. In this paper we consider various encoding problems for range queries on arrays. In these ...
We consider range queries that search for low-frequency elements (least frequent elements and α-mino...
A mode of a multiset S is an element a ∈ S of maximum multiplicity; that is, a occurs at least as fr...
A data base is said to allow range restrictions if we may request that only records with some specif...
The problem of parameterized range majority asks us to preprocess a string of length n such that, gi...