| No. |
Title |
Author |
Year |
| 1 |
A Parallel Framework for Approximate Max-Dicut in Partitionable Graphs |
Bertram, Nico et al. |
2022 |
| 2 |
Engineering Predecessor Data Structures for Dynamic Integer Sets |
Dinklage, Patrick et al. |
2021 |
| 3 |
Linear Time Runs Over General Ordered Alphabets |
Ellert, Jonas et al. |
2021 |
| 4 |
Lyndon Words Accelerate Suffix Sorting |
Bertram, Nico et al. |
2021 |
| 5 |
Practical Performance of Space Efficient Data Structures for Longest Common Extensions |
Dinklage, Patrick et al. |
2020 |
| 6 |
Space Efficient Construction of Lyndon Arrays in Linear Time |
Bille, Philip et al. |
2020 |
| 7 |
Bidirectional Text Compression in External Memory |
Dinklage, Patrick et al. |
2019 |
| 8 |
Synergies between Adaptive Analysis of Algorithms, Parameterized Complexity, Compressed Data Structures and Compressed Indices (Dagstuhl Seminar 18281) |
Barbay, Jérémy et al. |
2019 |
| 9 |
Compression with the tudocomp Framework |
Dinklage, Patrick et al. |
2017 |
| 10 |
Lempel-Ziv Compression in a Sliding Window |
Bille, Philip et al. |
2017 |
| 11 |
On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching |
Fischer, Johannes et al. |
2016 |
