Pages that link to "Item:Q5054830"
From MaRDI portal
The following pages link to Efficient algorithms for Lempel-Ziv encoding (Q5054830):
Displayed 24 items.
- Efficient retrieval of approximate palindromes in a run-length encoded string (Q428850) (← 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)
- Leaf languages and string compression (Q550251) (← links)
- A \textit{really} simple approximation of smallest grammar (Q906407) (← links)
- Efficient algorithms to compute compressed longest common substrings and compressed palindromes (Q1006070) (← links)
- The complexity of compressing subsegments of images described by finite automata (Q1861562) (← links)
- On the complexity of pattern matching for highly compressed two-dimensional texts. (Q1872708) (← links)
- Collage system: A unifying framework for compressed pattern matching. (Q1874240) (← links)
- On stricter reachable repetitiveness measures (Q2146140) (← links)
- Computing longest palindromic substring after single-character or block-wise edits (Q2227497) (← links)
- The complexity of compressed membership problems for finite automata (Q2254509) (← links)
- Compressed automata for dictionary matching (Q2344744) (← links)
- Tree compression with top trees (Q2347804) (← links)
- A PTIME-complete matching problem for SLP-compressed words (Q2390207) (← links)
- Equality Testing of Compressed Strings (Q3449353) (← links)
- Polynomial braid combing (Q4629388) (← links)
- Pattern-matching problems for 2-dimensional images described by finite automata (Q5055939) (← links)
- Engineering Practical Lempel-Ziv Tries (Q5102060) (← links)
- Longest substring palindrome after edit (Q5140775) (← links)
- Computing Longest Common Substring and All Palindromes from Compressed Strings (Q5448662) (← links)
- Recognizing string graphs in NP (Q5917583) (← links)
- Tracing compressed curves in triangulated surfaces (Q5919981) (← links)
- The fully compressed subgroup membership problem (Q6038521) (← links)