We show new data structures (a) of size $\frac{2n}{c(n)}-\Theta\bigl(\frac{n\lg\l g n}{ c(n)\lg n}\bigr)$ bits and query time $O(C(n))$ for any positive integer function, or (b) with O(nH_k)+o(n)$ query time.Expand

We present a direct algorithm for the general RMQ-problem with linear preprocessing time and constant query time, without making use of any dynamic data structure, and give a constant-time LCE-algorithm solely based on arrays.Expand

The Range-Minimum-Query-Problem is to preprocess an array of length n in O(n) time such that all subsequent queries asking for the position of a minimal element between two specified indices can be obtained in constant time.Expand

We present a novel compressed suffix tree, which is the first achieving at the same time sublogarithmic complexity for the operations, and space usage that asymptotically goes to zero as the entropy of the text does.Expand

We propose a new algorithmic framework that solves frequency-related data mining queries on databases of strings in optimal time, i.e., in time linear in the input and the output size.Expand

We present a class of algorithms which can solve the 2-dimensional Range Minimum Query-problem with O(kN) additional space, O(N log[k+1] N) preprocessing time and O(1) query time for any k > 1, where log is the iterated application of k + 1 logarithms.Expand

We present a data structure of optimal size at most nlog"2(3+22)+o(n) bits that allows us to answer the following queries on A in constant time, without accessing A.Expand