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