Ira Pohl
Artificial Intelligence
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
Chen-chia Chang, Wan-hsuan Lin, et al.
ICML 2025
Conference paper
Predicting knowledge in an ontology stream
Freddy Lécué, Jeff Z. Pan
IJCAI 2013
Saurabh Paul, Christos Boutsidis, et al.
JMLR