Pages that link to "Item:Q4928570"
From MaRDI portal
The following pages link to Approximation of Grammar-Based Compression via Recompression (Q4928570):
Displaying 18 items.
- One-variable word equations in linear time (Q261339) (← links)
- Approximation of smallest linear tree grammar (Q342719) (← links)
- Straight-line programs: a practical test (extended abstract) (Q376125) (← links)
- Approximation of grammar-based compression via recompression (Q500975) (← links)
- A \textit{really} simple approximation of smallest grammar (Q906407) (← links)
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression. (Q1401326) (← links)
- An online algorithm for lightweight grammar-based compression (Q1736509) (← links)
- Staged self-assembly and polyomino context-free grammars (Q2003475) (← links)
- A fully linear-time approximation algorithm for grammar-based compression (Q2569418) (← links)
- Approximation of smallest linear tree grammar (Q2965507) (← links)
- Grammar-Based Tree Compression (Q3451087) (← links)
- Grammar-Based Compression in a Streaming Model (Q3564868) (← links)
- Quasi-distinct Parsing and Optimal Compression Methods (Q3637102) (← links)
- Lyndon factorization of grammar compressed texts revisited (Q5140789) (← links)
- String Processing and Information Retrieval (Q5393963) (← links)
- Automata, Languages and Programming (Q5466495) (← links)
- Compressibility of Finite Languages by Grammars (Q5500684) (← links)
- String Processing and Information Retrieval (Q5897137) (← links)