Conference paper
Counterexample to theorems of Cox and Fine
Joseph Y. Halpern
aaai 1996
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
Guillaume Buthmann, Tomoya Sakai, et al.
ICASSP 2025
Harsha Kokel, Aamod Khatiwada, et al.
VLDB 2025
Guo-Jun Qi, Charu Aggarwal, et al.
IEEE TPAMI