Pages that link to "Item:Q2874365"
From MaRDI portal
The following pages link to Algorithmics on SLP-compressed strings: a survey (Q2874365):
Displaying 50 items.
- XML compression via directed acyclic graphs (Q269349) (← links)
- Approximation of smallest linear tree grammar (Q342719) (← links)
- An efficient algorithm to test square-freeness of strings compressed by straight-line programs (Q456098) (← 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)
- Efficient algorithms to compute compressed longest common substrings and compressed palindromes (Q1006070) (← 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)
- Certain query answering on compressed string patterns: from streams to hyperstreams (Q1798915) (← 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)
- Compressed string-matching in standard Sturmian words (Q2271418) (← 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)
- Fast \(q\)-gram mining on SLP compressed strings (Q2376810) (← links)
- A PTIME-complete matching problem for SLP-compressed words (Q2390207) (← links)
- Constructing small tree grammars and small circuits for formulas (Q2396826) (← links)
- Processing succinct matrices and vectors (Q2411035) (← links)
- Detecting regularities on grammar-compressed strings (Q2514148) (← 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)
- Leaf languages and string compression (Q3165967) (← 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)
- (Q4496242) (← links)
- Linear pattern matching of compressed terms and polynomial rewriting (Q4585011) (← links)
- NC algorithms for finding a maximal set of paths with application to compressing strings (Q4645170) (← links)
- Parallel identity testing for skew circuits with big powers and applications (Q4687480) (← links)
- Low-complexity computations for nilpotent subgroup problems (Q4968234) (← links)
- Nominal unification with atom and context variables (Q4993360) (← links)
- On the Balancedness of Tree-to-Word Transducers (Q5041263) (← links)
- (Q5090487) (← links)
- Logspace and compressed-word computations in nilpotent groups (Q5100019) (← links)
- Matching of Compressed Patterns with Character-Variables (Q5111911) (← 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)
