 | 2012 |
|---|
| 34 |       | Johannes Fischer,
Travis Gagie,
Tsvi Kopelowitz,
Moshe Lewenstein,
Veli Mäkinen,
Leena Salmela,
Niko Välimäki:
Forbidden Patterns.
LATIN 2012: 327-337 |
| 2011 |
|---|
| 33 | | Jérémy Barbay,
Johannes Fischer,
Gonzalo Navarro:
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations.
CPM 2011: 285-298 |
| 32 | | Arash Farzan,
Johannes Fischer:
Compact Representation of Posets.
ISAAC 2011: 302-311 |
| 31 | | Johannes Fischer:
Inducing the LCP-Array.
WADS 2011: 374-385 |
| 30 | | Johannes Fischer:
Inducing the LCP-Array
CoRR abs/1101.3448: (2011) |
| 29 | | Johannes Fischer:
Combined Data Structure for Previous- and Next-Smaller-Values
CoRR abs/1102.0395: (2011) |
| 28 | | Johannes Fischer,
Volker Heun:
Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays.
SIAM J. Comput. 40(2): 465-492 (2011) |
| 27 | | Johannes Fischer:
Combined data structure for previous- and next-smaller-values.
Theor. Comput. Sci. 412(22): 2451-2456 (2011) |
| 2010 |
|---|
| 26 | | Simon Gog,
Johannes Fischer:
Advantages of Shared Data Structures for Sequences of Balanced Parentheses.
DCC 2010: 406-415 |
| 25 | | Johannes Fischer:
Optimal Succinctness for Range Minimum Queries.
LATIN 2010: 158-169 |
| 24 | | Enno Ohlebusch,
Johannes Fischer,
Simon Gog:
CST++.
SPIRE 2010: 322-333 |
| 23 | | Jérémy Barbay,
Johannes Fischer:
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
CoRR abs/1009.5863: (2010) |
| 22 | | Johannes Fischer:
Wee LCP.
Inf. Process. Lett. 110(8-9): 317-320 (2010) |
| 21 | | Johannes Fischer,
Daniel H. Huson:
New common ancestor problems in trees and directed acyclic graphs.
Inf. Process. Lett. 110(8-9): 331-335 (2010) |
| 20 | | Johannes Fischer,
Volker Heun:
Finding Range Minima in the Middle: Approximations and Applications.
Mathematics in Computer Science 3(1): 17-30 (2010) |
| 2009 |
|---|
| 19 | | Johannes Fischer:
Short Labels for Lowest Common Ancestors in Trees.
ESA 2009: 752-763 |
| 18 | | Johannes Fischer:
Wee LCP
CoRR abs/0910.3123: (2009) |
| 17 | | Johannes Fischer,
Veli Mäkinen,
Gonzalo Navarro:
Faster entropy-bounded compressed suffix trees.
Theor. Comput. Sci. 410(51): 5354-5364 (2009) |
| 2008 |
|---|
| 16 | | Johannes Fischer,
Veli Mäkinen,
Gonzalo Navarro:
An(other) Entropy-Bounded Compressed Suffix Tree.
CPM 2008: 152-165 |
| 15 | | Johannes Fischer,
Volker Heun,
Horst Martin Stühler:
Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries.
DCC 2008: 272-281 |
| 14 | | Johannes Fischer,
Veli Mäkinen,
Niko Välimäki:
Space Efficient String Mining under Frequency Constraints.
ICDM 2008: 193-202 |
| 13 |  | Johannes Fischer,
Volker Heun:
Range Median of Minima Queries, Super-Cartesian Trees, and Text Indexing.
IWOCA 2008: 239-252 |
| 12 | | Johannes Fischer:
Optimal Succinctness for Range Minimum Queries
CoRR abs/0812.2775: (2008) |
| 2007 |
|---|
| 11 | | Amihood Amir,
Johannes Fischer,
Moshe Lewenstein:
Two-Dimensional Range Minimum Queries.
CPM 2007: 286-294 |
| 10 | | Paolo Ferragina,
Johannes Fischer:
Suffix Arrays on Words.
CPM 2007: 328-339 |
| 9 | | Johannes Fischer,
Volker Heun:
A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array.
ESCAPE 2007: 459-470 |
| 2006 |
|---|
| 8 | | Johannes Fischer,
Volker Heun:
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE.
CPM 2006: 36-48 |
| 7 | | Johannes Fischer,
Volker Heun,
Stefan Kramer:
Optimal String Mining Under Frequency Constraints.
PKDD 2006: 139-150 |
| 6 | | Simon W. Ginzinger,
Johannes Fischer:
SimShift: Identifying structural similarities from NMR chemical shifts.
Bioinformatics 22(4): 460-465 (2006) |
| 2005 |
|---|
| 5 | | Johannes Fischer,
Simon W. Ginzinger:
A 2-Approximation Algorithm for Sorting by Prefix Reversals.
ESA 2005: 415-425 |
| 4 | | Johannes Fischer,
Volker Heun,
Stefan Kramer:
Fast Frequent String Mining Using Suffix Arrays.
ICDM 2005: 609-612 |
| 2004 |
|---|
| 3 | | 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 |
Data released under the ODC-BY 1.0 license — See also our legal information page