On the Value of Multiple Read/Write Streams for Data Compression

DOI10.1007/978-3-642-02441-2_7zbMath1247.68083arXiv1204.1215OpenAlexW3176040087MaRDI QIDQ3637105

Travis Gagie

Publication date: 7 July 2009

Published in: Combinatorial Pattern Matching, Information Theory, Combinatorics, and Search Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.1215

zbMATH Keywords

data compressiononline algorithmsexternal-memory algorithmsread/write streams

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Online algorithms; streaming algorithms (68W27)

Related Items (4)

Bounds from a card trick ⋮ Lightweight data indexing and compression in external memory ⋮ Parallel algorithms for Burrows-Wheeler compression and decompression ⋮ On the Value of Multiple Read/Write Streams for Data Compression

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Space-efficient substring occurrence estimation
• Large alphabets and incompressibility
• Reversal complexity revisited
• Selection and sorting with limited storage
• Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
• Tight lower bounds for query processing on streaming and external memory data
• Lightweight data indexing and compression in external memory
• Compressed representations of sequences and full-text indexes
• An analysis of the Burrows—Wheeler transform
• Move-to-Front, Distance Coding, and Inversion Frequencies Revisited
• Data Streams: Algorithms and Applications
• Space-Conscious Compression
• The Smallest Grammar Problem
• Clustering by Compression
• Grammar-Based Compression in a Streaming Model
• On the Value of Multiple Read/Write Streams for Data Compression
• Complexity of strings in the class of Markov sources
• Reversal Complexity
• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding
• Redundancy of the Lempel-Ziv incremental parsing rule
• FUNCTIONAL PEARL Inverting the Burrows–Wheeler transform
• Compression of Low Entropy Strings with Lempel--Ziv Algorithms
• An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms
• Elements of Information Theory
• LATIN 2004: Theoretical Informatics

This page was built for publication: On the Value of Multiple Read/Write Streams for Data Compression