- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications.

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

Given a static array of $n$ totally ordered objects, the range minimum query problem is to build a data structure that allows us to answer efficiently subsequent on-line queries of the form “what is… (More)

- Johannes Fischer, Volker Heun
- CPM
- 2006

The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a direct algorithm for… (More)

- Johannes Fischer, Volker Heun
- ESCAPE
- 2007

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… (More)

- Johannes Fischer
- LATIN
- 2008

For a static array A of n totally ordered objects, a range minimum query asks for the position of the minimum between two specified array indices. We show how to preprocess A into a scheme of size… (More)

- Timo Bingmann, Johannes Fischer, Vitaly Osipov
- ALENEX
- 2013

- Johannes Fischer, Volker Heun, Stefan Kramer
- PKDD
- 2006

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. The additional… (More)

- Johannes Fischer
- WADS
- 2011

We show how to modify the linear-time construction algorithm for suffix arrays based on induced sorting (Nong et al., DCC'09) such that it computes the array of longest common prefixes (LCP-array) as… (More)

- Johannes Fischer
- Theor. Comput. Sci.
- 2011

Let A be a static array storing n elements from a totally ordered set. 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… (More)

- Johannes Fischer, Veli Mäkinen, Gonzalo Navarro
- Theor. Comput. Sci.
- 2009

Suffix trees are among the most important data structures in stringology, with a number of applications in flourishing areas like bioinformatics. Their main problem is space usage, which has… (More)

- Johannes Fischer, Pawel Gawrychowski
- CPM
- 2013

We consider finding a pattern of length \(m\) in a compacted (linear-size) trie storing strings over an alphabet of size \(\sigma \). In static tries, we achieve \(O(m+\lg \lg \sigma )\)… (More)