Pages that link to "Item:Q2874365"

The following pages link to Algorithmics on SLP-compressed strings: A survey (Q2874365):

Displaying 48 items.

• XML compression via directed acyclic graphs (Q269349) (← links)
• Approximation of smallest linear tree grammar (Q342719) (← links)
• Approximation of grammar-based compression via recompression (Q500975) (← links)
• Unambiguous conjunctive grammars over a one-symbol alphabet (Q507593) (← links)
• Constant-time tree traversal and subtree equality check for grammar-compressed trees (Q724220) (← links)
• Constant delay traversal of grammar-compressed graphs with bounded rank (Q776844) (← links)
• A \textit{really} simple approximation of smallest grammar (Q906407) (← links)
• Knapsack in graph groups (Q1702854) (← links)
• On the compressibility of finite languages and formal proofs (Q1706152) (← links)
• Evaluation of circuits over nilpotent and polycyclic groups (Q1750355) (← links)
• Compaction of Church numerals (Q2005559) (← links)
• On the complexity of the smallest grammar problem over fixed alphabets (Q2035481) (← links)
• Balancing straight-line programs for strings and trees (Q2106614) (← links)
• Compression techniques in group theory (Q2117795) (← links)
• The complexity of compressed membership problems for finite automata (Q2254509) (← links)
• Approximate pattern matching in LZ77-compressed texts (Q2343301) (← links)
• Tree compression with top trees (Q2347804) (← links)
• Fast distance multiplication of unit-Monge matrices (Q2350900) (← links)
• Constructing small tree grammars and small circuits for formulas (Q2396826) (← links)
• Processing succinct matrices and vectors (Q2411035) (← links)
• Inter-procedural Two-Variable Herbrand Equalities (Q2802449) (← links)
• Random Access to High-Order Entropy Compressed Text (Q2848976) (← links)
• Parallel Identity Testing for Skew Circuits with Big Powers and Applications (Q2946414) (← links)
• Evaluating Matrix Circuits (Q3196387) (← links)
• Solutions to twisted word equations and equations in virtually free groups (Q3299596) (← links)
• (Q3304147) (← links)
• Equality Testing of Compressed Strings (Q3449353) (← links)
• Compressed Tree Canonization (Q3449487) (← links)
• Grammar-Based Tree Compression (Q3451087) (← links)
• Approximating LZ77 via Small-Space Multiple-Pattern Matching (Q3452816) (← links)
• Linear pattern matching of compressed terms and polynomial rewriting (Q4585011) (← links)
• Parallel identity testing for skew circuits with big powers and applications (Q4687480) (← links)
• Low-complexity computations for nilpotent subgroup problems (Q4968234) (← links)
• (Q4993360) (← links)
• On the Balancedness of Tree-to-Word Transducers (Q5041263) (← links)
• (Q5090487) (← links)
• Logspace and compressed-word computations in nilpotent groups (Q5100019) (← links)
• Online LZ77 Parsing and Matching Statistics with RLBWTs (Q5140769) (← links)
• SLP compression for solutions of equations with constraints in free and hyperbolic groups (Q5246505) (← links)
• Compressibility of Finite Languages by Grammars (Q5500684) (← links)
• Grammar-based compression of unranked trees (Q5915574) (← links)
• Logspace computations in graph products (Q5925209) (← links)
• Complexity of word problems for HNN-extensions (Q5925702) (← links)
• The fully compressed subgroup membership problem (Q6038521) (← links)
• On the Balancedness of Tree-to-Word Transducers (Q6169900) (← links)
• Data structures for SMEM-finding in the PBWT (Q6545416) (← links)
• Extended formulations via decision diagrams (Q6591617) (← links)
• Compressed decision problems in hyperbolic groups (Q6619327) (← links)