Journal of the ACM

Paper

01 Jan 1981

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

Paper

On preservation under homomorphisms and unions of conjunctive queries

Albert Atserias, Anuj Dawar, et al.

Journal of the ACM

Conference paper

Trimming the ₁ regularizer: Statistical analysis, optimization, and applications to deep learning

Jihun Yun, Peng Zheng, et al.

ICML 2019

Paper

Interactive scheduling as a constraint satisfiability problem

Ronen Feldman, Martin Charles Golumbic

Ann. Math. Artif. Intell.

Conference paper

LaFTer: Label-Free Tuning of Zero-shot Classifier using Language and Unlabeled Image Collections

Jehanzeb Mirza, Leonid Karlinsky, et al.

NeurIPS 2023

View all publications