Abstract The Lempel-Ziv (LZ77) factorization of a string is a widely-used algorithmic tool that
plays a central role in data compression and indexing. For a length-n string over integer …

Dictionary-based compression schemes are the most commonly used data compression
schemes since they appeared in the foundational paper of Ziv and Lempel in 1977, and …

Dynamic dictionary-based compression schemes are the most daily used data compression
schemes since they appeared in the foundational paper of Ziv and Lempel in 1977 …

Stringology is a subfield of computer science dedicated to analyzing and processing
sequences of symbols. It plays a crucial role in various applications, including lossless …

LZ77-based compression schemes compress the input text by replacing factors in the text
with an encoded reference to a previous occurrence formed by the couple (length, offset) …

Linear-time optimal parsing algorithms are rare in the dictionary-based branch of the data
compression theory. A recent result is the Flexible Parsing algorithm of Matias and Sahinalp …

The greedy approach to dictionary-based static text compression can be executed by a finite-
state machine. When it is applied in parallel to different blocks of data independently, there …

We make a worst case analysis of practical implementations of LZ2 compression, where the
work space remains constant with the increase of the data size and the optimal solution must …

This paper investigates the size in bits of the LZ77 encoding, which is the most popular and
efficient variant of the Lempel-Ziv encodings used in data compression. We prove that, for a …

Scalability and robustness are not an issue when compression is applied for massive data
storage, in the context of distributed computing. Speeding up on-the-fly compression for data …