A worst-case analysis of the LZ2 compression algorithm
type: Item
instance of: scholarly article
title: A worst-case analysis of the LZ2 compression algorithm
zbMATH Open document ID: 0895.68027
author: Sergio De Agostino
author: Riccardo Silvestri
published in: Information and Computation
publication date: 1998-09-08T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 1138494
zbMATH Keywords: parsing
zbMATH Keywords: de Bruijn sequences
MaRDI profile type: Publication
full work available at URL: inco.1997.2668
OpenAlex ID: W2041248510
cites work: On-line versus off-line computation in dynamic text compression
cites work: On the Complexity of Finite Sequences
cites work: A universal algorithm for sequential data compression
cites work: Q4002255
cites work: On encoding and decoding with two-way head machines
cites work: Compression of individual sequences via variable-rate coding
DOI: 10.1006/INCO.1997.2668
description: scientific article; zbMATH DE number 1138494