Pages that link to "Item:Q2569418"
From MaRDI portal
The following pages link to A fully linear-time approximation algorithm for grammar-based compression (Q2569418):
Displayed 17 items.
- One-dimensional staged self-assembly (Q256717) (← links)
- One-variable word equations in linear time (Q261339) (← links)
- Approximation of smallest linear tree grammar (Q342719) (← links)
- Approximation of grammar-based compression via recompression (Q500975) (← links)
- Functional programs as compressed data (Q526441) (← links)
- A \textit{really} simple approximation of smallest grammar (Q906407) (← links)
- Linear-time text compression by longest-first substitution (Q1662518) (← links)
- On the compressibility of finite languages and formal proofs (Q1706152) (← links)
- Universal compressed text indexing (Q1729689) (← links)
- Practical compressed suffix trees (Q1736557) (← links)
- Tree compression using string grammars (Q1742370) (← links)
- Constructing small tree grammars and small circuits for formulas (Q2396826) (← links)
- Grammar compressed sequences with rank/select support (Q2397151) (← links)
- Document listing on repetitive collections with guaranteed performance (Q2632016) (← links)
- One-Dimensional Staged Self-assembly (Q3092336) (← links)
- Faster Compressed Suffix Trees for Repetitive Collections (Q5266617) (← links)
- Compressibility of Finite Languages by Grammars (Q5500684) (← links)