Kenneth L. Clarkson, Elad Hazan, et al.
Journal of the ACM
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
Hannah Kim, Celia Cintas, et al.
IJCAI 2023
Alon Itai, Michael Rodeh
Information and Computation
Liya Fan, Fa Zhang, et al.
JPDC