Pages that link to "Item:Q3092248"
From MaRDI portal
The following pages link to Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic (Q3092248):
Displaying 13 items.
- Approximation of grammar-based compression via recompression (Q500975) (← links)
- A \textit{really} simple approximation of smallest grammar (Q906407) (← links)
- String matching in Lempel-Ziv compressed strings (Q1386349) (← links)
- Comparison of LZ77-type parsings (Q1621503) (← links)
- The complexity of compressed membership problems for finite automata (Q2254509) (← links)
- Approximate pattern matching in LZ77-compressed texts (Q2343301) (← links)
- Substring compression problems (Q2921685) (← links)
- Longest $$\alpha $$-Gapped Repeat and Palindrome (Q2947867) (← links)
- Approximating LZ77 via Small-Space Multiple-Pattern Matching (Q3452816) (← links)
- Efficient algorithms for Lempel-Ziv encoding (Q5054830) (← links)
- Computing the Antiperiod(s) of a String (Q5088925) (← links)
- Space-efficient conversions from SLPs (Q6547925) (← links)
- Internal pattern matching queries in a text and applications (Q6621750) (← links)