R. Sebastian, M. Weise, et al.
ECPPM 2022
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
Erik Altman, Jovan Blanusa, et al.
NeurIPS 2023
S. Winograd
Journal of the ACM
Miao Guo, Yong Tao Pei, et al.
WCITS 2011