Optimal LZ-end parsing is hard

DOI10.4230/LIPICS.CPM.2023.3MaRDI QIDQ6622005zbMATH OpenFDO

Authors Hideo Bannai, Mitsuru Funakoshi, Kazuhiro Kurita, Yuto Nakashima, Kazuhisa Seto, Takeaki Uno

Publication date 21 October 2024

Full work available at URL https://doi.org/10.4230/LIPICS.CPM.2023.3

zbMATH Keywords

data compressionLZ-endrepetitiveness measures

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cited in

(4)

• New advances in rightmost Lempel-Ziv
• On the number of factors in the LZ-End factorization
• Hardness and approximability of bounded access Lempel Ziv coding
• On the complexity and approximability of bounded access Lempel Ziv coding

This page was built for publication: Optimal LZ-end parsing is hard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6622005)