Johannes Fischer 0001
Person information
- affiliation: Technische Universität Dortmund, Germany
Other persons with the same name
- Johannes Fischer
- Johannes Fischer 0002 — Universität Erlangen-Nürnberg
- Johannes Fischer 0003 — Institut für Datenverarbeitung in der Technik, KfK, Karlsruhe, Germany
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2019
- [c41]Johannes Fischer, Florian Kurpicz:
Lightweight Distributed Suffix Array Construction. ALENEX 2019: 27-38 - 2018
- [j14]Julian Arz, Johannes Fischer:
Lempel-Ziv-78 Compressed String Dictionaries. Algorithmica 80(7): 2012-2047 (2018) - [j13]Johannes Fischer, Tomohiro I, Dominik Köppl, Kunihiko Sadakane:
Lempel-Ziv Factorization Powered by Space Efficient Suffix Trees. Algorithmica 80(7): 2048-2081 (2018) - [c40]Johannes Fischer, Florian Kurpicz, Marvin Löbel:
Simple, Fast and Lightweight Parallel Wavelet Tree Construction. ALENEX 2018: 9-20 - [i17]Jérémy Barbay, Johannes Fischer, Stefan Kratsch, Srinivasa Rao Satti:
Synergies between Adaptive Analysis of Algorithms, Parameterized Complexity, Compressed Data Structures and Compressed Indices (Dagstuhl Seminar 18281). Dagstuhl Reports 8(7): 44-61 (2018) - 2017
- [c39]Johannes Fischer, Florian Kurpicz, Peter Sanders:
Engineering a Distributed Full-Text Index. ALENEX 2017: 120-134 - [c38]Philip Bille, Patrick Hagge Cording, Johannes Fischer, Inge Li Gørtz:
Lempel-Ziv Compression in a Sliding Window. CPM 2017: 15:1-15:11 - [c37]Daniel Peters, Johannes Fischer, Florian Thiel, Jean-Pierre Seifert:
FLOUDS: A Succinct File System Structure. FedCSIS Position Papers 2017: 51-57 - [c36]Johannes Fischer, Arno Pasternak:
Modularisierung im Informatikunttericht aus lernpsychologischer Perspektive. INFOS 2017: 247-256 - [c35]Johannes Fischer, Dominik Köppl:
Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries. SPIRE 2017: 191-207 - [c34]
- [c33]Patrick Dinklage, Johannes Fischer, Dominik Köppl, Marvin Löbel, Kunihiko Sadakane:
Compression with the tudocomp Framework. SEA 2017: 13:1-13:22 - [i16]Patrick Dinklage, Johannes Fischer, Dominik Köppl, Marvin Löbel, Kunihiko Sadakane:
Compression with the tudocomp Framework. CoRR abs/1702.07577 (2017) - [i15]Johannes Fischer, Florian Kurpicz:
Fast and Simple Parallel Wavelet Tree and Matrix Construction. CoRR abs/1702.07578 (2017) - [i14]Johannes Fischer, Dominik Köppl:
Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries. CoRR abs/1706.03035 (2017) - [i13]
- 2016
- [j12]Johannes Fischer, Daniel Peters:
GLOUDS: Representing tree-like graphs. J. Discrete Algorithms 36: 39-49 (2016) - [j11]Timo Bingmann, Johannes Fischer, Vitaly Osipov:
Inducing Suffix and LCP Arrays in External Memory. ACM Journal of Experimental Algorithmics 21(1): 2.3:1-2.3:27 (2016) - [j10]Philip Bille, Johannes Fischer, Inge Li Gørtz, Tsvi Kopelowitz, Benjamin Sach, Hjalte Wedel Vildhøj:
Sparse Text Indexing in Small Space. ACM Trans. Algorithms 12(3): 39:1-39:19 (2016) - [c32]Johannes Fischer, Dominik Köppl, Florian Kurpicz:
On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching. CPM 2016: 26:1-26:11 - [c31]Johannes Fischer, Tomohiro I, Dominik Köppl:
Deterministic Sparse Suffix Sorting on Rewritable Texts. LATIN 2016: 483-496 - [r1]
- [i12]Johannes Fischer, Dominik Köppl, Florian Kurpicz:
On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching. CoRR abs/1606.02465 (2016) - [i11]Johannes Fischer, Florian Kurpicz, Peter Sanders:
Engineering a Distributed Full-Text Index. CoRR abs/1610.03332 (2016) - 2015
- [c30]Johannes Fischer, Pawel Gawrychowski:
Alphabet-Dependent String Searching with Wexponential Search Trees. CPM 2015: 160-171 - [c29]Johannes Fischer, Tomohiro I, Dominik Köppl:
Lempel Ziv Computation in Small Space (LZ-CISS). CPM 2015: 172-184 - [c28]Johannes Fischer, Travis Gagie, Pawel Gawrychowski, Tomasz Kociumaka:
Approximating LZ77 via Small-Space Multiple-Pattern Matching. ESA 2015: 533-544 - [c27]Johannes Fischer, Stepan Holub, Tomohiro I, Moshe Lewenstein:
Beyond the Runs Theorem. SPIRE 2015: 277-286 - [c26]Johannes Fischer, Daniel Peters:
A Practical Succinct Data Structure for Tree-Like Graphs. WALCOM 2015: 65-76 - [i10]Johannes Fischer, Tomohiro I, Dominik Köppl:
Lempel Ziv Computation In Small Space (LZ-CISS). CoRR abs/1504.02605 (2015) - [i9]Johannes Fischer, Travis Gagie, Pawel Gawrychowski, Tomasz Kociumaka:
Approximating LZ77 via Small-Space Multiple-Pattern Matching. CoRR abs/1504.06647 (2015) - [i8]Johannes Fischer, Tomohiro I, Dominik Köppl:
Deterministic Sparse Suffix Sorting on Rewritable Texts. CoRR abs/1509.07417 (2015) - 2014
- [j9]Kai Beskers, Johannes Fischer:
High-Order Entropy Compressed Bit Vectors with Rank/Select. Algorithms 7(4): 608-620 (2014) - [c25]
- 2013
- [c24]Timo Bingmann, Johannes Fischer, Vitaly Osipov:
Inducing Suffix and Lcp Arrays in External Memory. ALENEX 2013: 88-102 - [c23]Philip Bille, Johannes Fischer, Inge Li Gørtz, Tsvi Kopelowitz, Benjamin Sach, Hjalte Wedel Vildhøj:
Sparse Suffix Tree Construction in Small Space. ICALP (1) 2013: 148-159 - [c22]Lars Arge, Johannes Fischer, Peter Sanders, Nodari Sitchinava:
On (Dynamic) Range Minimum Queries in External Memory. WADS 2013: 37-48 - [e1]Johannes Fischer, Peter Sanders:
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 [contents] - [i7]Johannes Fischer, Pawel Gawrychowski:
Alphabet-Dependent String Searching with Wexponential Search Trees. CoRR abs/1302.3347 (2013) - [i6]
- 2012
- [j8]Jérémy Barbay, Johannes Fischer, Gonzalo Navarro:
LRM-Trees: Compressed indices, adaptive sorting, and compressed permutations. Theor. Comput. Sci. 459: 26-41 (2012) - [c21]Johannes Fischer, Travis Gagie, Tsvi Kopelowitz, Moshe Lewenstein, Veli Mäkinen, Leena Salmela, Niko Välimäki:
Forbidden Patterns. LATIN 2012: 327-337 - 2011
- [j7]Johannes Fischer, Volker Heun:
Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays. SIAM J. Comput. 40(2): 465-492 (2011) - [j6]Johannes Fischer:
Combined data structure for previous- and next-smaller-values. Theor. Comput. Sci. 412(22): 2451-2456 (2011) - [c20]Jérémy Barbay, Johannes Fischer, Gonzalo Navarro:
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations. CPM 2011: 285-298 - [c19]
- [c18]
- [i5]
- [i4]Johannes Fischer:
Combined Data Structure for Previous- and Next-Smaller-Values. CoRR abs/1102.0395 (2011) - 2010
- [j5]
- [j4]Johannes Fischer, Daniel H. Huson:
New common ancestor problems in trees and directed acyclic graphs. Inf. Process. Lett. 110(8-9): 331-335 (2010) - [j3]Johannes Fischer, Volker Heun:
Finding Range Minima in the Middle: Approximations and Applications. Mathematics in Computer Science 3(1): 17-30 (2010) - [c17]
- [c16]
- [c15]
- [i3]Jérémy Barbay, Johannes Fischer:
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations. CoRR abs/1009.5863 (2010)
2000 – 2009
- 2009
- [j2]Johannes Fischer, Veli Mäkinen, Gonzalo Navarro:
Faster entropy-bounded compressed suffix trees. Theor. Comput. Sci. 410(51): 5354-5364 (2009) - [c14]
- [i2]
- 2008
- [c13]Johannes Fischer, Veli Mäkinen, Gonzalo Navarro:
An(other) Entropy-Bounded Compressed Suffix Tree. CPM 2008: 152-165 - [c12]Johannes Fischer, Volker Heun, Horst Martin Stühler:
Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries. DCC 2008: 272-281 - [c11]Johannes Fischer, Veli Mäkinen, Niko Välimäki:
Space Efficient String Mining under Frequency Constraints. ICDM 2008: 193-202 - [c10]Johannes Fischer, Volker Heun:
Range Median of Minima Queries, Super-Cartesian Trees, and Text Indexing. IWOCA 2008: 239-252 - [i1]
- 2007
- [c9]Amihood Amir, Johannes Fischer, Moshe Lewenstein:
Two-Dimensional Range Minimum Queries. CPM 2007: 286-294 - [c8]
- [c7]Johannes Fischer, Volker Heun:
A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array. ESCAPE 2007: 459-470 - 2006
- [j1]Simon W. Ginzinger, Johannes Fischer:
SimShift: Identifying structural similarities from NMR chemical shifts. Bioinformatics 22(4): 460-465 (2006) - [c6]Johannes Fischer, Volker Heun:
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE. CPM 2006: 36-48 - [c5]Johannes Fischer, Volker Heun, Stefan Kramer:
Optimal String Mining Under Frequency Constraints. PKDD 2006: 139-150 - 2005
- [c4]Johannes Fischer, Simon W. Ginzinger:
A 2-Approximation Algorithm for Sorting by Prefix Reversals. ESA 2005: 415-425 - [c3]Johannes Fischer, Volker Heun, Stefan Kramer:
Fast Frequent String Mining Using Suffix Arrays. ICDM 2005: 609-612 - 2004
- [c2]Johannes Fischer, Luc De Raedt:
Towards Optimizing Conjunctive Inductive Queries. PAKDD 2004: 625-637 - 2003
- [c1]
Coauthor Index
last updated on 2019-02-16 23:11 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint