• Publications
  • Influence
Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
TLDR
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
  • 208
  • 27
  • PDF
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
TLDR
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
  • 160
  • 17
Optimal Succinctness for Range Minimum Queries
  • J. Fischer
  • Mathematics, Computer Science
  • LATIN
  • 15 December 2008
TLDR
We show how to preprocess A into a scheme of size 2n+o(n) bits that allows to answer range minimum queries on A in constant time. Expand
  • 87
  • 17
  • PDF
A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
TLDR
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
  • 154
  • 14
Inducing Suffix and LCP Arrays in External Memory
TLDR
We consider full text index construction in external memory (EM). Expand
  • 40
  • 8
  • PDF
A 2-Approximation Algorithm for Sorting by Prefix Reversals
TLDR
We present the first polynomial-time 2-approximation algorithm to solve this problem. Expand
  • 38
  • 7
  • PDF
Faster entropy-bounded compressed suffix trees
TLDR
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
  • 91
  • 6
  • PDF
Optimal String Mining Under Frequency Constraints
TLDR
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
  • 47
  • 6
Two-Dimensional Range Minimum Queries
TLDR
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
  • 31
  • 6
  • PDF
Combined data structure for previous- and next-smaller-values
  • J. Fischer
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 2 February 2011
TLDR
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
  • 30
  • 6
  • PDF
...
1
2
3
4
5
...