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 Compressed String Index in δ-Optimal Space
Open theoretical framework and simulator for universal nanofabrication via a Matter Virtual Machine: executable compression, photonic routing, distributed self-assembly, and information-theoretic bounds on programmable matter.
Dynamic Grammar-based Compression for Random Accesses
Binary Smallest Grammar Problem NP-completeness candidate proof - manuscript, verification code, reproducibility tests, and expert-audit materials.
To associate your repository with the grammar-compression topic, visit your repo's landing page and select "manage topics."