| No. |
Title |
Author |
Year |
| 1 |
Predecessor on the Ultra-Wide Word RAM |
Bille, Philip et al. |
2022 |
| 2 |
The Fine-Grained Complexity of Episode Matching |
Bille, Philip et al. |
2022 |
| 3 |
Gapped Indexing for Consecutive Occurrences |
Bille, Philip et al. |
2021 |
| 4 |
Front Matter, Table of Contents, Preface, Conference Organization |
Gørtz, Inge Li et al. |
2020 |
| 5 |
LIPIcs, Volume 161, CPM 2020, Complete Volume |
Gørtz, Inge Li et al. |
2020 |
| 6 |
Random Access in Persistent Strings |
Bille, Philip et al. |
2020 |
| 7 |
Space Efficient Construction of Lyndon Arrays in Linear Time |
Bille, Philip et al. |
2020 |
| 8 |
String Indexing for Top-k Close Consecutive Occurrences |
Bille, Philip et al. |
2020 |
| 9 |
String Indexing with Compressed Patterns |
Bille, Philip et al. |
2020 |
| 10 |
From Regular Expression Matching to Parsing |
Bille, Philip et al. |
2019 |
| 11 |
Theoretical Foundations of Storage Systems (Dagstuhl Seminar 19111) |
Farach-Colton, Martin et al. |
2019 |
| 12 |
Top Tree Compression of Tries |
Bille, Philip et al. |
2019 |
| 13 |
Deterministic Indexing for Packed Strings |
Bille, Philip et al. |
2017 |
| 14 |
Fast Dynamic Arrays |
Bille, Philip et al. |
2017 |
| 15 |
Lempel-Ziv Compression in a Sliding Window |
Bille, Philip et al. |
2017 |
| 16 |
Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing |
Bille, Philip et al. |
2017 |
| 17 |
Distance Labeling Schemes for Trees |
Alstrup, Stephen et al. |
2016 |
| 18 |
Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation |
Bille, Philip et al. |
2016 |
