Hironori Takeuchi, Tetsuya Nasukawa, et al.
Transactions of the Japanese Society for 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
Conference paper
Counterexample to theorems of Cox and Fine
Joseph Y. Halpern
aaai 1996
Daniel Karl I. Weidele, Priyanshu Rai, et al.
AAAI 2026
Saeel Sandeep Nachane, Ojas Gramopadhye, et al.
EMNLP 2024