Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarJohannes Fischer 0001
Person information
- affiliation: Technische Universität Dortmund, Germany
Other persons with the same name
- Johannes Fischer 0002 — Universität Erlangen-Nürnberg
- Johannes Fischer 0003 — Institut für Datenverarbeitung in der Technik, KfK, Karlsruhe, Germany
- Johannes Fischer 0004 — Bosch Connected Devices and Solutions GmbH, Reutlingen, Germany
- Johannes Fischer 0005 — Regensburg University of Applied Sciences, Germany
- Johannes Fischer 0006 — Fraunhofer IIS, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c45]Patrick Dinklage, Johannes Fischer, Florian Kurpicz:
Constructing the Wavelet Tree and Wavelet Matrix in Distributed Memory. ALENEX 2020: 214-228- [c44]Philip Bille, Jonas Ellert, Johannes Fischer, Inge Li Gørtz, Florian Kurpicz, J. Ian Munro, Eva Rotenberg:
Space Efficient Construction of Lyndon Arrays in Linear Time. ICALP 2020: 14:1-14:18 - [i20]Jonas Ellert, Johannes Fischer, Nodari Sitchinava:
LCP-Aware Parallel String Sorting. CoRR abs/2006.02219 (2020)
2010 – 2019
- 2019
- [c43]Johannes Fischer, Florian Kurpicz:
Lightweight Distributed Suffix Array Construction. ALENEX 2019: 27-38 - [c42]Patrick Dinklage, Jonas Ellert, Johannes Fischer, Dominik Köppl
, Manuel Penschuck:
Bidirectional Text Compression in External Memory. ESA 2019: 41:1-41:16 - [c41]Johannes Bahne, Nico Bertram, Marvin Böcker, Jonas Bode, Johannes Fischer, Hermann Foot, Florian Grieskamp, Florian Kurpicz, Marvin Löbel, Oliver Magiera, Rosa Pink, David Piper, Christopher Poeplau:
SACABench: Benchmarking Suffix Array Construction. SPIRE 2019: 407-416 - [i19]Patrick Dinklage, Jonas Ellert, Johannes Fischer, Dominik Köppl, Manuel Penschuck:
Bidirectional Text Compression in External Memory. CoRR abs/1907.03235 (2019) - [i18]Philip Bille, Jonas Ellert, Johannes Fischer, Inge Li Gørtz, Florian Kurpicz, Ian Munro, Eva Rotenberg:
Space Efficient Construction of Lyndon Arrays in Linear Time. CoRR abs/1911.03542 (2019) - 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]Johannes Fischer, Florian Kurpicz:
Dismantling DivSufSort. Stringology 2017: 62-76 - [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]Johannes Fischer, Florian Kurpicz:
Dismantling DivSufSort. CoRR abs/1710.01896 (2017) - 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 J. Exp. 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]Johannes Fischer:
Compressed Range Minimum Queries. Encyclopedia of Algorithms 2016: 379-382 - [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]Julian Arz, Johannes Fischer:
LZ-Compressed String Dictionaries. DCC 2014: 322-331 - 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]Julian Arz, Johannes Fischer:
LZ-Compressed String Dictionaries. CoRR abs/1305.0674 (2013) - 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]Arash Farzan, Johannes Fischer:
Compact Representation of Posets. ISAAC 2011: 302-311 - [c18]Johannes Fischer:
Inducing the LCP-Array. WADS 2011: 374-385 - [i5]Johannes Fischer:
Inducing the LCP-Array. CoRR abs/1101.3448 (2011) - [i4]Johannes Fischer:
Combined Data Structure for Previous- and Next-Smaller-Values. CoRR abs/1102.0395 (2011) - 2010
- [j5]Johannes Fischer:
Wee LCP. Inf. Process. Lett. 110(8-9): 317-320 (2010) - [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]Simon Gog, Johannes Fischer:
Advantages of Shared Data Structures for Sequences of Balanced Parentheses. DCC 2010: 406-415 - [c16]Johannes Fischer:
Optimal Succinctness for Range Minimum Queries. LATIN 2010: 158-169 - [c15]Enno Ohlebusch, Johannes Fischer, Simon Gog:
CST++. SPIRE 2010: 322-333 - [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]Johannes Fischer:
Short Labels for Lowest Common Ancestors in Trees. ESA 2009: 752-763 - [i2]Johannes Fischer:
Wee LCP. CoRR abs/0910.3123 (2009) - 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]Johannes Fischer:
Optimal Succinctness for Range Minimum Queries. CoRR abs/0812.2775 (2008) - 2007
- [c9]Amihood Amir, Johannes Fischer, Moshe Lewenstein:
Two-Dimensional Range Minimum Queries. CPM 2007: 286-294 - [c8]Paolo Ferragina, Johannes Fischer:
Suffix Arrays on Words. CPM 2007: 328-339 - [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. Bioinform. 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]Johannes Fischer, Luc De Raedt:
Towards Optimizing Conjunctive Inductive Queries. KDID 2003: 44-59
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org and opencitations.net to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy.
Citation data
Add a list of citing articles from to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter accout. At the same time, Twitter will persitently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2020-07-01 23:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
