Nicolae Dobra, Jakiw Pidstrigach, et al.
NeurIPS 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
Harsha Kokel, Aamod Khatiwada, et al.
VLDB 2025
Jihun Yun, Peng Zheng, et al.
ICML 2019
Ken C.L. Wong, Satyananda Kashyap, et al.
Pattern Recognition Letters