| No. |
Title |
Author |
Year |
| 1 |
Document Retrieval Hacks |
Puglisi, Simon J. et al. |
2021 |
| 2 |
Front Matter, Table of Contents, Preface, Conference Organization |
Bonchi, Filippo et al. |
2021 |
| 3 |
LIPIcs, Volume 202, MFCS 2021, Complete Volume |
Bonchi, Filippo et al. |
2021 |
| 4 |
Weighted Ancestors in Suffix Trees Revisited |
Belazzougui, Djamal et al. |
2021 |
| 5 |
Fast and Simple Compact Hashing via Bucketing |
Köppl, Dominik et al. |
2020 |
| 6 |
Pattern Discovery in Colored Strings |
Lipták, Zsuzsanna et al. |
2020 |
| 7 |
Computing the Antiperiod(s) of a String |
Alamro, Hayam et al. |
2019 |
| 8 |
A Succinct Solution to Rmap Alignment |
Muggli, Martin D. et al. |
2018 |
| 9 |
Disentangled Long-Read De Bruijn Graphs via Optical Maps |
Alipanahi, Bahar et al. |
2017 |
| 10 |
Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers |
Iliopoulos, Costas S. et al. |
2017 |
| 11 |
LIPIcs, Volume 75, SEA'17, Complete Volume |
Iliopoulos, Costas S. et al. |
2017 |
| 12 |
On the Size of Lempel-Ziv and Lyndon Factorizations |
Kärkkäinen, Juha et al. |
2017 |
| 13 |
String Inference from Longest-Common-Prefix Array |
Kärkkäinen, Juha et al. |
2017 |
| 14 |
Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction |
Tanimura, Yuka et al. |
2016 |
