Leonid Karlinsky, Joseph Shtok, et al.
CVPR 2019
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
Gang Liu, Michael Sun, et al.
ICLR 2025
Hironori Takeuchi, Tetsuya Nasukawa, et al.
Transactions of the Japanese Society for Artificial Intelligence
Kenneth L. Clarkson, Elad Hazan, et al.
Journal of the ACM