Fast and space-efficient conversion from the LZ77 parsing to a grammar
-
Updated
Oct 25, 2025 - C++
Fast and space-efficient conversion from the LZ77 parsing to a grammar
Recompression technique of Artur Jez
The Generalized Smallest Grammar Problem
This project focuses on lossless compression techniques optimizing space, time, and energy for multiplications between binary (or ternary) matrix formats and real-valued vectors.
Dynamic Grammar-based Compression for Random Accesses
Dynamic Grammar−based Compressed String Index in δ-Optimal Space
Add a description, image, and links to the grammar-compression topic page so that developers can more easily learn about it.
To associate your repository with the grammar-compression topic, visit your repo's landing page and select "manage topics."