Johannes Fischer

ORCID

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 55

Top Venues

Publications

Patrick Dinklage, Johannes Fischer, Nicola Prezza
Top- k Frequent Patterns in Streams and Parameterized-Space LZ Compression. SEA (2024)
Nico Bertram, Johannes Fischer, Lukas Nalbach
Move-r: Optimizing the r-index. SEA (2024)
Patrick Dinklage, Johannes Fischer, Florian Kurpicz, Jan-Philipp Tarnowski
Bit-Parallel Wavelet Tree Construction (Abstract). HOPC@SPAA (2024)
Jan Hendrik Krone, Johannes Fischer
From Tree to Forest: Determining the Probability of Scoring a Goal in Football Games. ISSEP (Local Proceedings) (2023)
Martin Weinert, Jan Hendrik Krone, Johannes Fischer
Teaching the Von-Neumann Model with a Simulator. ISSEP (Local Proceedings) (2023)
Philip Bille, Johannes Fischer, Inge Li Gørtz, Max Rishøj Pedersen, Tord Joakim Stordalen
Sliding Window String Indexing in Streams. CPM (2023)
Patrick Dinklage, Johannes Fischer, Florian Kurpicz, Jan-Philipp Tarnowski
Bit-Parallel (Compressed) Wavelet Tree Construction. DCC (2023)
Philip Bille, Johannes Fischer, Inge Li Gørtz, Max Rishøj Pedersen, Tord Joakim Stordalen
Sliding Window String Indexing in Streams. CoRR (2023)
Jonas Ellert, Johannes Fischer, Max Rishøj Pedersen
New Advances in Rightmost Lempel-Ziv. SPIRE (2023)
Jan Laumeyer, Jan Hendrik Krone, Johannes Fischer
Ein Roboter lernt laufen: Vermittlung von Konzepten des verstärkenden Lernens im Informatikunterricht. INFOS (2023)
Nico Bertram, Jonas Ellert, Johannes Fischer
A Parallel Framework for Approximate Max-Dicut in Partitionable Graphs. SEA (2022)
Jonas Ellert, Johannes Fischer
Linear Time Runs Over General Ordered Alphabets. ICALP (2021)
Kensuke Akao, Johannes Fischer
Zum Stand der Lehramtsausbildung für einen inklusiven Informatikunterricht. INFOS (2021)
Patrick Dinklage, Jonas Ellert, Johannes Fischer, Florian Kurpicz, Marvin Löbel
Practical Wavelet Tree Construction. ACM J. Exp. Algorithmics 26 (2021)
Jonas Ellert, Johannes Fischer
Linear Time Runs over General Ordered Alphabets. CoRR (2021)
Nico Bertram, Jonas Ellert, Johannes Fischer
Lyndon Words Accelerate Suffix Sorting. ESA (2021)
Patrick Dinklage, Johannes Fischer, Alexander Herlez
Engineering Predecessor Data Structures for Dynamic Integer Sets. SEA (2021)
Johannes Fischer, Martin Weinert
Reflexionsförderung bei Lehramtsstudierenden durch den Einsatz von videobasierten Aufgaben. INFOS (2021)
Diego Arroyuelo, Rodrigo Cánovas, Johannes Fischer, Dominik Köppl, Marvin Löbel, Gonzalo Navarro, Rajeev Raman
Engineering Practical Lempel-Ziv Tries. ACM J. Exp. Algorithmics 26 (2021)
Patrick Dinklage, Johannes Fischer, Alexander Herlez
Engineering Predecessor Data Structures for Dynamic Integer Sets. CoRR (2021)
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)
Johannes Fischer, Nora Romahn, Martin Weinert
Fostering Reflection in CS Teacher Education. A Video-Based Approach to Unveiling, Analyzing and Teaching Novices' Programming Processes. ISSEP (CEURWS Volume) (2020)
Jonas Ellert, Johannes Fischer, Nodari Sitchinava
LCP-Aware Parallel String Sorting. CoRR (2020)
Patrick Dinklage, Johannes Fischer, Florian Kurpicz
Constructing the Wavelet Tree and Wavelet Matrix in Distributed Memory. ALENEX (2020)
Patrick Dinklage, Johannes Fischer, Alexander Herlez, Tomasz Kociumaka, Florian Kurpicz
Practical Performance of Space Efficient Data Structures for Longest Common Extensions. ESA (2020)
Arno Pasternak, Johannes Fischer
To Project or Not to Project: In Search of the Pathway to Object Orientation. ISSEP (CEURWS Volume) (2020)
Johannes Fischer, Tomohiro I, Dominik Köppl
Deterministic Sparse Suffix Sorting in the Restore Model. ACM Trans. Algorithms 16 (4) (2020)
Jonas Ellert, Johannes Fischer, Nodari Sitchinava
LCP-Aware Parallel String Sorting. Euro-Par (2020)
Patrick Dinklage, Jonas Ellert, Johannes Fischer, Dominik Köppl, Manuel Penschuck
Bidirectional Text Compression in External Memory. CoRR (2019)
Johannes Fischer, Florian Kurpicz
Lightweight Distributed Suffix Array Construction. ALENEX (2019)
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)
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 (2019)
Patrick Dinklage, Jonas Ellert, Johannes Fischer, Dominik Köppl, Manuel Penschuck
Bidirectional Text Compression in External Memory. ESA (2019)
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) (2018)
Johannes Fischer, Florian Kurpicz, Marvin Löbel
Simple, Fast and Lightweight Parallel Wavelet Tree Construction. ALENEX (2018)
Johannes Fischer, Tomohiro I, Dominik Köppl, Kunihiko Sadakane
Lempel-Ziv Factorization Powered by Space Efficient Suffix Trees. Algorithmica 80 (7) (2018)
Julian Arz, Johannes Fischer
Lempel-Ziv-78 Compressed String Dictionaries. Algorithmica 80 (7) (2018)
Johannes Fischer, Dominik Köppl
Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries. SPIRE (2017)
Patrick Dinklage, Johannes Fischer, Dominik Köppl, Marvin Löbel, Kunihiko Sadakane
Compression with the tudocomp Framework. SEA (2017)
Patrick Dinklage, Johannes Fischer, Dominik Köppl, Marvin Löbel, Kunihiko Sadakane
Compression with the tudocomp Framework. CoRR (2017)
Daniel Peters, Johannes Fischer, Florian Thiel, Jean-Pierre Seifert
FLOUDS: A Succinct File System Structure. FedCSIS (Position Papers) (2017)
Johannes Fischer, Florian Kurpicz
Fast and Simple Parallel Wavelet Tree and Matrix Construction. CoRR (2017)
Johannes Fischer, Florian Kurpicz
Dismantling DivSufSort. Stringology (2017)
Johannes Fischer, Florian Kurpicz
Dismantling DivSufSort. CoRR (2017)
Johannes Fischer, Arno Pasternak
Modularisierung im Informatikunttericht aus lernpsychologischer Perspektive. INFOS (2017)
Johannes Fischer, Florian Kurpicz, Peter Sanders
Engineering a Distributed Full-Text Index. ALENEX (2017)
Philip Bille, Patrick Hagge Cording, Johannes Fischer, Inge Li Gørtz
Lempel-Ziv Compression in a Sliding Window. CPM (2017)
Johannes Fischer, Dominik Köppl
Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries. CoRR (2017)
Johannes Fischer, Florian Kurpicz, Peter Sanders
Engineering a Distributed Full-Text Index. CoRR (2016)
Johannes Fischer, Dominik Köppl, Florian Kurpicz
On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching. CPM (2016)
Johannes Fischer, Tomohiro I, Dominik Köppl
Deterministic Sparse Suffix Sorting on Rewritable Texts. LATIN (2016)
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) (2016)
Johannes Fischer, Dominik Köppl, Florian Kurpicz
On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching. CoRR (2016)
Timo Bingmann, Johannes Fischer, Vitaly Osipov
Inducing Suffix and LCP Arrays in External Memory. ACM J. Exp. Algorithmics 21 (1) (2016)
Johannes Fischer, Daniel Peters
GLOUDS: Representing tree-like graphs. J. Discrete Algorithms 36 (2016)
Johannes Fischer, Travis Gagie, Pawel Gawrychowski, Tomasz Kociumaka
Approximating LZ77 via Small-Space Multiple-Pattern Matching. ESA (2015)
Johannes Fischer, Pawel Gawrychowski
Alphabet-Dependent String Searching with Wexponential Search Trees. CPM (2015)
Johannes Fischer, Tomohiro I, Dominik Köppl
Lempel Ziv Computation in Small Space (LZ-CISS). CPM (2015)
Johannes Fischer, Stepan Holub, Tomohiro I, Moshe Lewenstein
Beyond the Runs Theorem. SPIRE (2015)
Johannes Fischer, Tomohiro I, Dominik Köppl
Lempel Ziv Computation In Small Space (LZ-CISS). CoRR (2015)
Johannes Fischer, Tomohiro I, Dominik Köppl
Deterministic Sparse Suffix Sorting on Rewritable Texts. CoRR (2015)
Johannes Fischer, Travis Gagie, Pawel Gawrychowski, Tomasz Kociumaka
Approximating LZ77 via Small-Space Multiple-Pattern Matching. CoRR (2015)
Johannes Fischer, Daniel Peters
A Practical Succinct Data Structure for Tree-Like Graphs. WALCOM (2015)
Kai Beskers, Johannes Fischer
High-Order Entropy Compressed Bit Vectors with Rank/Select. Algorithms 7 (4) (2014)
Julian Arz, Johannes Fischer
LZ-Compressed String Dictionaries. DCC (2014)
Timo Bingmann, Johannes Fischer, Vitaly Osipov
Inducing Suffix and Lcp Arrays in External Memory. ALENEX (2013)
Julian Arz, Johannes Fischer
LZ-Compressed String Dictionaries CoRR (2013)
Johannes Fischer, Pawel Gawrychowski
Alphabet-Dependent String Searching with Wexponential Search Trees CoRR (2013)
Lars Arge, Johannes Fischer, Peter Sanders, Nodari Sitchinava
On (Dynamic) Range Minimum Queries in External Memory. WADS (2013)
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)
Johannes Fischer, Travis Gagie, Tsvi Kopelowitz, Moshe Lewenstein, Veli Mäkinen, Leena Salmela, Niko Välimäki
Forbidden Patterns. LATIN (2012)
Jérémy Barbay, Johannes Fischer, Gonzalo Navarro
LRM-Trees: Compressed indices, adaptive sorting, and compressed permutations. Theor. Comput. Sci. 459 (2012)
Arash Farzan, Johannes Fischer
Compact Representation of Posets. ISAAC (2011)
Johannes Fischer
Combined Data Structure for Previous- and Next-Smaller-Values CoRR (2011)
Johannes Fischer
Inducing the LCP-Array CoRR (2011)
Johannes Fischer, Volker Heun
Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays. SIAM J. Comput. 40 (2) (2011)
Jérémy Barbay, Johannes Fischer, Gonzalo Navarro
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations. CPM (2011)
Johannes Fischer
Combined data structure for previous- and next-smaller-values. Theor. Comput. Sci. 412 (22) (2011)
Johannes Fischer
Inducing the LCP-Array. WADS (2011)
Simon Gog, Johannes Fischer
Advantages of Shared Data Structures for Sequences of Balanced Parentheses. DCC (2010)
Johannes Fischer, Volker Heun
Finding Range Minima in the Middle: Approximations and Applications. Math. Comput. Sci. 3 (1) (2010)
Johannes Fischer
Optimal Succinctness for Range Minimum Queries. LATIN (2010)
Johannes Fischer, Daniel H. Huson
New common ancestor problems in trees and directed acyclic graphs. Inf. Process. Lett. 110 (8-9) (2010)
Enno Ohlebusch, Johannes Fischer, Simon Gog
CST++. SPIRE (2010)
Jérémy Barbay, Johannes Fischer
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations CoRR (2010)
Johannes Fischer
Wee LCP. Inf. Process. Lett. 110 (8-9) (2010)
Johannes Fischer
Short Labels for Lowest Common Ancestors in Trees. ESA (2009)
Johannes Fischer
Wee LCP CoRR (2009)
Johannes Fischer, Veli Mäkinen, Gonzalo Navarro
Faster entropy-bounded compressed suffix trees. Theor. Comput. Sci. 410 (51) (2009)
Johannes Fischer
Optimal Succinctness for Range Minimum Queries CoRR (2008)
Johannes Fischer, Veli Mäkinen, Gonzalo Navarro
An(other) Entropy-Bounded Compressed Suffix Tree. CPM (2008)
Johannes Fischer, Volker Heun
Range Median of Minima Queries, Super-Cartesian Trees, and Text Indexing. IWOCA (2008)
Johannes Fischer, Volker Heun, Horst Martin Stühler
Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries. DCC (2008)
Johannes Fischer, Veli Mäkinen, Niko Välimäki
Space Efficient String Mining under Frequency Constraints. ICDM (2008)
Paolo Ferragina, Johannes Fischer
Suffix Arrays on Words. CPM (2007)
Johannes Fischer, Volker Heun
A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array. ESCAPE (2007)
Amihood Amir, Johannes Fischer, Moshe Lewenstein
Two-Dimensional Range Minimum Queries. CPM (2007)
Johannes Fischer, Volker Heun, Stefan Kramer
Optimal String Mining Under Frequency Constraints. PKDD (2006)
Johannes Fischer, Volker Heun
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE. CPM (2006)
Simon W. Ginzinger, Johannes Fischer
SimShift: Identifying structural similarities from NMR chemical shifts. Bioinform. 22 (4) (2006)

Johannes Fischer.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Johannes Fischer