| 2008 |
|---|
| 15 | EE | Johannes Fischer,
Veli Mäkinen,
Gonzalo Navarro:
An(other) Entropy-Bounded Compressed Suffix Tree.
CPM 2008: 152-165 |
| 14 | EE | Johannes Fischer,
Volker Heun,
Horst Martin Stühler:
Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries.
DCC 2008: 272-281 |
| 13 | EE | Johannes Fischer,
Veli Mäkinen,
Niko Välimäki:
Space Efficient String Mining under Frequency Constraints.
ICDM 2008: 193-202 |
| 12 | EE | Johannes Fischer:
Optimal Succinctness for Range Minimum Queries
CoRR abs/0812.2775: (2008) |
| 2007 |
|---|
| 11 | EE | Amihood Amir,
Johannes Fischer,
Moshe Lewenstein:
Two-Dimensional Range Minimum Queries.
CPM 2007: 286-294 |
| 10 | EE | Paolo Ferragina,
Johannes Fischer:
Suffix Arrays on Words.
CPM 2007: 328-339 |
| 9 | EE | Johannes Fischer,
Volker Heun:
A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array.
ESCAPE 2007: 459-470 |
| 2006 |
|---|
| 8 | EE | Johannes Fischer,
Volker Heun:
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE.
CPM 2006: 36-48 |
| 7 | EE | Johannes Fischer,
Volker Heun,
Stefan Kramer:
Optimal String Mining Under Frequency Constraints.
PKDD 2006: 139-150 |
| 6 | EE | Simon W. Ginzinger,
Johannes Fischer:
SimShift: Identifying structural similarities from NMR chemical shifts.
Bioinformatics 22(4): 460-465 (2006) |
| 2005 |
|---|
| 5 | EE | Johannes Fischer,
Simon W. Ginzinger:
A 2-Approximation Algorithm for Sorting by Prefix Reversals.
ESA 2005: 415-425 |
| 4 | EE | Johannes Fischer,
Volker Heun,
Stefan Kramer:
Fast Frequent String Mining Using Suffix Arrays.
ICDM 2005: 609-612 |
| 2004 |
|---|
| 3 | EE | Johannes Fischer,
Luc De Raedt:
Towards Optimizing Conjunctive Inductive Queries.
PAKDD 2004: 625-637 |
| 2003 |
|---|
| 2 | | Johannes Fischer,
Luc De Raedt:
Towards Optimizing Conjunctive Inductive Queries.
KDID 2003: 44-59 |
| 1990 |
|---|
| 1 | | Jan Mark Pohlmann,
Johannes Fischer,
Andreas Jaeschke:
Wissensbasiertes Hypermedia-System zur Erkennung von Ackerpflanzen und Beurteilung von Standorten.
Informatik für den Umweltschutz 1990: 257-266 |
