Johannes Fischer

Timo Bingmann, Johannes Fischer, Vitaly Osipov: Inducing Suffix and Lcp Arrays in External Memory. ALENEX 2013: 88-102

Johannes Fischer, Peter Sanders (Eds.): Combinatorial Pattern Matching, 24th Annual Symposium, CPM 2013, Bad Herrenalb, Germany, June 17-19, 2013. Proceedings. Lecture Notes in Computer Science 7922, Springer 2013, isbn 978-3-642-38904-7

Johannes Fischer, Pawel Gawrychowski: Alphabet-Dependent String Searching with Wexponential Search Trees. CoRR abs/1302.3347 (2013)

Jérémy Barbay, Johannes Fischer, Gonzalo Navarro: LRM-Trees: Compressed indices, adaptive sorting, and compressed permutations. Theor. Comput. Sci. 459: 26-41 (2012)

Johannes Fischer, Travis Gagie, Tsvi Kopelowitz, Moshe Lewenstein, Veli Mäkinen, Leena Salmela, Niko Välimäki: Forbidden Patterns. LATIN 2012: 327-337

Johannes Fischer, Volker Heun: Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays. SIAM J. Comput. 40(2): 465-492 (2011)

Johannes Fischer: Combined data structure for previous- and next-smaller-values. Theor. Comput. Sci. 412(22): 2451-2456 (2011)

Jérémy Barbay, Johannes Fischer, Gonzalo Navarro: LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations. CPM 2011: 285-298

Arash Farzan, Johannes Fischer: Compact Representation of Posets. ISAAC 2011: 302-311

Johannes Fischer: Inducing the LCP-Array. WADS 2011: 374-385

Johannes Fischer: Inducing the LCP-Array. CoRR abs/1101.3448 (2011)

Johannes Fischer: Combined Data Structure for Previous- and Next-Smaller-Values. CoRR abs/1102.0395 (2011)

Johannes Fischer: Wee LCP. Inf. Process. Lett. 110(8-9): 317-320 (2010)

Johannes Fischer, Daniel H. Huson: New common ancestor problems in trees and directed acyclic graphs. Inf. Process. Lett. 110(8-9): 331-335 (2010)

Johannes Fischer, Volker Heun: Finding Range Minima in the Middle: Approximations and Applications. Mathematics in Computer Science 3(1): 17-30 (2010)

Simon Gog, Johannes Fischer: Advantages of Shared Data Structures for Sequences of Balanced Parentheses. DCC 2010: 406-415

Johannes Fischer: Optimal Succinctness for Range Minimum Queries. LATIN 2010: 158-169

Enno Ohlebusch, Johannes Fischer, Simon Gog: CST++. SPIRE 2010: 322-333

Jérémy Barbay, Johannes Fischer: LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations. CoRR abs/1009.5863 (2010)

Johannes Fischer, Veli Mäkinen, Gonzalo Navarro: Faster entropy-bounded compressed suffix trees. Theor. Comput. Sci. 410(51): 5354-5364 (2009)

Johannes Fischer: Short Labels for Lowest Common Ancestors in Trees. ESA 2009: 752-763

Johannes Fischer: Wee LCP. CoRR abs/0910.3123 (2009)

Johannes Fischer, Veli Mäkinen, Gonzalo Navarro: An(other) Entropy-Bounded Compressed Suffix Tree. CPM 2008: 152-165

Johannes Fischer, Volker Heun, Horst Martin Stühler: Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries. DCC 2008: 272-281

Johannes Fischer, Veli Mäkinen, Niko Välimäki: Space Efficient String Mining under Frequency Constraints. ICDM 2008: 193-202

Johannes Fischer, Volker Heun: Range Median of Minima Queries, Super-Cartesian Trees, and Text Indexing. IWOCA 2008: 239-252

Johannes Fischer: Optimal Succinctness for Range Minimum Queries. CoRR abs/0812.2775 (2008)

Amihood Amir, Johannes Fischer, Moshe Lewenstein: Two-Dimensional Range Minimum Queries. CPM 2007: 286-294

Paolo Ferragina, Johannes Fischer: Suffix Arrays on Words. CPM 2007: 328-339

Johannes Fischer, Volker Heun: A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array. ESCAPE 2007: 459-470

Simon W. Ginzinger, Johannes Fischer: SimShift: Identifying structural similarities from NMR chemical shifts. Bioinformatics 22(4): 460-465 (2006)

Johannes Fischer, Volker Heun: Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE. CPM 2006: 36-48

Johannes Fischer, Volker Heun, Stefan Kramer: Optimal String Mining Under Frequency Constraints. PKDD 2006: 139-150

Johannes Fischer, Simon W. Ginzinger: A 2-Approximation Algorithm for Sorting by Prefix Reversals. ESA 2005: 415-425

Johannes Fischer, Volker Heun, Stefan Kramer: Fast Frequent String Mining Using Suffix Arrays. ICDM 2005: 609-612

Johannes Fischer, Luc De Raedt: Towards Optimizing Conjunctive Inductive Queries. PAKDD 2004: 625-637

Johannes Fischer, Luc De Raedt: Towards Optimizing Conjunctive Inductive Queries. KDID 2003: 44-59

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