P. Trespeuch, Y. Fournier, et al.
Civil-Comp Proceedings
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
Annina Riedhauser, Viacheslav Snigirev, et al.
CLEO 2023
Lars Graf, Thomas Bohnstingl, et al.
NeurIPS 2025
Zijian Ding, Michelle Brachman, et al.
C&C 2025