Yannis Belkhiter, Dhaval Salwala, et al.
NFV-SDN 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
Guo-Jun Qi, Charu Aggarwal, et al.
IEEE TPAMI
Susan L. Spraragen
International Conference on Design and Emotion 2010
Nicolae Dobra, Jakiw Pidstrigach, et al.
NeurIPS 2025