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
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014
Arnold L. Rosenberg
Journal of the ACM
Segev Shlomov, Avi Yaeli
CHI 2024