Baihan Lin, Guillermo Cecchi, et al.
IJCAI 2023
Paper
Linear Algorithm for Data Compression via String Matching
Abstract
A linear implementation of the optimal universal data compression methods of Lempel and Ziv is described. The main tool is McCreight's algorithm for constructing suffix trees. Both bounded and unbounded memory are considered. © 1981, ACM. All rights reserved.
Related
Nicolae Dobra, Jakiw Pidstrigach, et al.
NeurIPS 2025
Dzung Phan, Vinicius Lima
INFORMS 2023
Corey Liam Lammie, Yotam Perlitz, et al.
VLDB 2026