Shashank Ahire, Melissa Guyre, et al.
CUI 2025
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
C.A. Micchelli, W.L. Miranker
Journal of the ACM
Conrad Albrecht, Jannik Schneider, et al.
CVPR 2025
Leonid Karlinsky, Joseph Shtok, et al.
CVPR 2019