@InProceedings{bille_et_al:LIPIcs.CPM.2024.9,
author = {Bille, Philip and Fuglsang, Christian Mikkelsen and G{\o}rtz, Inge Li},
title = {{Tight Bounds for Compressing Substring Samples}},
booktitle = {35th Annual Symposium on Combinatorial Pattern Matching (CPM 2024)},
pages = {9:1--9:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-326-3},
ISSN = {1868-8969},
year = {2024},
volume = {296},
editor = {Inenaga, Shunsuke and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2024.9},
URN = {urn:nbn:de:0030-drops-201192},
doi = {10.4230/LIPIcs.CPM.2024.9},
annote = {Keywords: Compression, Algorithms, Lempel-Ziv}
}