scientific article; zbMATH DE number 7559179

DOI10.4230/LIPIcs.CPM.2019.11MaRDI QIDQ5088899

Michał Gánczorz

Publication date: 18 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

compressionlower boundsparsingempirical entropy

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites Work

• Unnamed Item
• Unnamed Item
• Large alphabets and incompressibility
• A simple storage scheme for strings achieving entropy bounds
• Indexing text using the Ziv--Lempel trie
• Lempel-Ziv index for \(q\)-grams
• A comparison of index-based lempel-Ziv LZ77 factorization algorithms
• Compressed representations of sequences and full-text indexes
• Self-indexing Based on LZ77
• Self-Indexed Grammar-Based Compression
• The Smallest Grammar Problem
• Squeezing succinct data structures into entropy bounds
• Grammar-based codes: a new class of universal lossless source codes
• Compression of Low Entropy Strings with Lempel--Ziv Algorithms
• Dynamic entropy-compressed sequences and full-text indexes
• RePair and All Irreducible Grammars are Upper Bounded by High-Order Empirical Entropy
• Statistical Encoding of Succinct Data Structures
• Dynamic Compressed Strings with Random Access