Pages that link to "Item:Q5402538"
From MaRDI portal
The following pages link to The macro model for data compression (Extended Abstract) (Q5402538):
Displaying 17 items.
- Approximation of smallest linear tree grammar (Q342719) (← links)
- Approximation of grammar-based compression via recompression (Q500975) (← links)
- A \textit{really} simple approximation of smallest grammar (Q906407) (← links)
- Approximability of minimum AND-circuits (Q1024782) (← links)
- On finding minimal length superstrings (Q1140992) (← links)
- On the compressibility of finite languages and formal proofs (Q1706152) (← links)
- Dynamic relative compression, dynamic partial sums, and substring concatenation (Q1755738) (← links)
- A theory of incremental compression (Q2056272) (← links)
- A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem (Q2344005) (← links)
- A fully linear-time approximation algorithm for grammar-based compression (Q2569418) (← links)
- Generalized Context Modeling With Multi-Directional Structuring and MDL-Based Model Selection for Heterogeneous Data Compression (Q4580880) (← links)
- (Q4786189) (← links)
- Forty Years of Text Indexing (Q4928554) (← links)
- Compressibility of Finite Languages by Grammars (Q5500684) (← links)
- Optimal encoding of non-stationary sources (Q5944439) (← links)
- (Q6065455) (← links)
- Random access in persistent strings and segment selection (Q6174650) (← links)