The following pages link to Johannes Fischer (Q533895):
Displaying 50 items.
- Combined data structure for previous- and next-smaller-values (Q533896) (← links)
- Finding range minima in the middle: approximations and applications (Q626956) (← links)
- Lempel-Ziv-78 compressed string dictionaries (Q724216) (← links)
- Lempel-Ziv factorization powered by space efficient suffix trees (Q724218) (← links)
- Wee LCP (Q991794) (← links)
- New common ancestor problems in trees and directed acyclic graphs (Q991797) (← links)
- Faster entropy-bounded compressed suffix trees (Q1038474) (← links)
- High-order entropy compressed bit vectors with rank/select (Q1736624) (← links)
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations (Q1758161) (← links)
- Deterministic Sparse Suffix Sorting on Rewritable Texts (Q2802962) (← links)
- On (Dynamic) Range Minimum Queries in External Memory (Q2842141) (← links)
- Forbidden Patterns (Q2894477) (← links)
- Alphabet-Dependent String Searching with Wexponential Search Trees (Q2942254) (← links)
- Lempel Ziv Computation in Small Space (LZ-CISS) (Q2942255) (← links)
- LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations (Q3011862) (← links)
- Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays (Q3020013) (← links)
- (Q3104275) (← links)
- Compact Representation of Posets (Q3104625) (← links)
- Approximating LZ77 via Small-Space Multiple-Pattern Matching (Q3452816) (← links)
- Two-Dimensional Range Minimum Queries (Q3506930) (← links)
- Suffix Arrays on Words (Q3506934) (← links)
- An(other) Entropy-Bounded Compressed Suffix Tree (Q3506950) (← links)
- (Q3521160) (← links)
- Optimal Succinctness for Range Minimum Queries (Q3557018) (← links)
- A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array (Q3611932) (← links)
- Short Labels for Lowest Common Ancestors in Trees (Q3639288) (← links)
- (Q4580160) (← links)
- Sparse Text Indexing in Small Space (Q4962616) (← links)
- Bidirectional Text Compression in External Memory (Q5075783) (← links)
- Practical Wavelet Tree Construction (Q5102058) (← links)
- Engineering Practical Lempel-Ziv Tries (Q5102060) (← links)
- Lempel-Ziv Compression in a Sliding Window (Q5110879) (← links)
- Constructing the Wavelet Tree and Wavelet Matrix in Distributed Memory (Q5147514) (← links)
- Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries (Q5150931) (← links)
- Inducing the LCP-Array (Q5199258) (← links)
- Inducing Suffix and LCP Arrays in External Memory (Q5232450) (← links)
- Engineering a Distributed Full-Text Index (Q5232570) (← links)
- Simple, Fast and Lightweight Parallel Wavelet Tree Construction (Q5232717) (← links)
- Lightweight Distributed Suffix Array Construction (Q5232749) (← links)
- Inducing Suffix and LCP Arrays in External Memory (Q5266606) (← links)
- Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE (Q5307491) (← links)
- Sparse Suffix Tree Construction in Small Space (Q5326557) (← links)
- On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching (Q5369561) (← links)
- Algorithms – ESA 2005 (Q5475852) (← links)
- Practical Performance of Space Efficient Data Structures for Longest Common Extensions. (Q5874509) (← links)
- Deterministic Sparse Suffix Sorting in the Restore Model (Q5888941) (← links)
- Lyndon Words Accelerate Suffix Sorting. (Q6075900) (← links)
- (Q6159890) (← links)
- New advances in rightmost Lempel-Ziv (Q6545424) (← links)
- Sliding window string indexing in streams (Q6622006) (← links)
