Prof. Dr. Johannes Fischer
- I have moved to TU Dortmund
- Johannes Fischer ∂does-not-exist.cs tu-dortmund de
- ls11-www.cs.uni-dortmund.de/fischer/start
Research Interests
- text indexing: CPM 2013
- succinct data structures
- combinatorial problems
- my Erdős number is at most 3 (via D. H. Huson -> J. H. Conway -> P. Erdős and via Peter Sanders -> Nicholas C. Wormald -> Paul Erdős)
- my profile on Google Scholar Citations (incl. h-index)
| Title | Author | Source |
|---|---|---|
| On (Dynamic) Range Minimum Queries in External Memory | L. Arge, J. Fischer, P. Sanders, N. Sitchinava | WADS'13 |
| Sparse Suffix Tree Construction in Small Space | P. Bille, J. Fischer, I. L. Gørtz, T. Kopelowitz, B. Sach, H. W. Vildhøj | ICALP'13 |
| Inducing Suffix and LCP Arrays in External Memory | Timo Bingmann, Johannes Fischer and Vitaly Osipov |
ALENEX'13 (to appear) |
| LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations. | J. Barbay, J. Fischer, G. Navarro |
Theoretical Computer Science 459 (1), 26–41, 2012 |
| Forbidden Patterns | J. Fischer, T. Gagie, T. Kopelowitz, M. Lewenstein, V. Mäkinen, L. Salmela, N. Välimäki |
Proceedings of the 10th Latin American Theoretical Informatics Symposium (LATIN'12), Lecture Notes in Computer Science 7256, 327-337, Springer-Verlag, 2012. |
| Compact Representation of Posets | A. Farzan, J. Fischer |
Proc. 22nd International Symposium on Algorithms and Computation (ISAAC 2011), Lecture Notes in Computer Science 7074, 302-311, Springer-Verlag, 2011. |
| LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations | J. Barbay, J. Fischer, G. Navarro |
Proc. 22nd Annual Symposium on Combinatorial Pattern Matching (CPM'11), Lecture Notes in Computer Science 6661, 285-298, Springer-Verlag, 2011. |
| Inducing the LCP-Array | J. Fischer |
Proc. 12th Algorithms and Data Structures Symposium (WADS'11), Lecture Notes in Computer Science 6844, 374-385, Springer-Verlag, 2011. |
| Combined Data Structure for Previous- and Next-Smaller-Values | J. Fischer |
Theoretical Computer Science 412 (22), 2451–2456, 2011 |
| Space Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays | J. Fischer, V. Heun |
SIAM Journal on Computing 40(2), 465-492, 2011 |
| CST++ | E. Ohlebusch, J. Fischer, S. Gog |
Proc. 17th Symposium on String Processing and Information Retrieval (SPIRE'10), Lecture Notes in Computer Science 6393, 322-333, Springer-Verlag, 2010. |
| Advantages of Shared Data Structures for Sequences of Balanced Parentheses | S. Gog, J. Fischer | Proceedings of the 2010 Data Compression Conference (DCC'10), 406-415, IEEE Press, 2010 |
| Finding Range Minima in the Middle: Approximations and Applications | J. Fischer, V. Heun | Mathematics in Computer Science 3(1), 17-30, 2010 |
| Wee LCP | J. Fischer | Information Processing Letters 110(8-9), 317-320, 2010 |
| New Common Ancestor Problems in Trees and Directed Acyclic Graphs | J. Fischer, D. H. Huson |
Information Processing Letters 110(8-9), 331-335, 2010 |
| Optimal Succinctness for Range Minimum Queries | J. Fischer |
Proceedings of the 9th Latin American Theoretical Informatics Symposium (LATIN'10), Lecture Notes in Computer Science 6034, 158-169, Springer-Verlag, 2010. |