Pages that link to "Item:Q500975"

The following pages link to Approximation of grammar-based compression via recompression (Q500975):

Displaying 28 items.

• Approximation of smallest linear tree grammar (Q342719) (← links)
• Straight-line programs: a practical test (extended abstract) (Q376125) (← 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)
• Comparison of LZ77-type parsings (Q1621503) (← links)
• A separation between RLSLPs and LZ77 (Q1632509) (← links)
• On the compressibility of finite languages and formal proofs (Q1706152) (← links)
• Universal compressed text indexing (Q1729689) (← links)
• An online algorithm for lightweight grammar-based compression (Q1736509) (← links)
• Tree compression using string grammars (Q1742370) (← links)
• Balancing straight-line programs for strings and trees (Q2106614) (← links)
• Constructing small tree grammars and small circuits for formulas (Q2396826) (← links)
• A fully linear-time approximation algorithm for grammar-based compression (Q2569418) (← links)
• Document listing on repetitive collections with guaranteed performance (Q2632016) (← links)
• Grammar-compressed indexes with logarithmic search time (Q2656171) (← links)
• Approximation of smallest linear tree grammar (Q2965507) (← links)
• Grammar-Based Compression in a Streaming Model (Q3564868) (← links)
• Quasi-distinct Parsing and Optimal Compression Methods (Q3637102) (← links)
• Approximation of Grammar-Based Compression via Recompression (Q4928570) (← links)
• (Q5009593) (← links)
• Lyndon factorization of grammar compressed texts revisited (Q5140789) (← links)
• A Self-index on Block Trees (Q5150940) (← links)
• String Processing and Information Retrieval (Q5393963) (← links)
• Automata, Languages and Programming (Q5466495) (← links)
• Compressibility of Finite Languages by Grammars (Q5500684) (← links)
• Approximation ratios of \textsf{RePair}, \textsf{LongestMatch} and \textsf{Greedy} on unary strings (Q6536243) (← links)
• Rpair: rescaling RePair with Rsync (Q6536245) (← links)
• Computing all-vs-all MEMs in grammar-compressed text (Q6545422) (← links)