Cristina Cornelio, Judy Goldsmith, et al.
JAIR
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
Guojing Cong, David A. Bader
Journal of Parallel and Distributed Computing
Alain Vaucher, Philippe Schwaller, et al.
AMLD EPFL 2022
Dzung Phan, Vinicius Lima
INFORMS 2023