Efficient algorithms for Lempel-Ziv encoding
From MaRDI portal
Publication:5054830
DOI10.1007/3-540-61422-2_148zbMath1502.68379MaRDI QIDQ5054830
Wojciech Plandowski, Marek Karpinski, Leszek Gąsieniec, Wojciech Rytter
Publication date: 9 December 2022
Published in: Algorithm Theory — SWAT'96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61422-2_148
68W40: Analysis of algorithms
68Q45: Formal languages and automata
68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
68W32: Algorithms on strings
Related Items
Polynomial braid combing, Pattern-matching problems for 2-dimensional images described by finite automata, Engineering Practical Lempel-Ziv Tries, Longest substring palindrome after edit, Computing Longest Common Substring and All Palindromes from Compressed Strings, Recognizing string graphs in NP, Tracing compressed curves in triangulated surfaces, The fully compressed subgroup membership problem, Efficient retrieval of approximate palindromes in a run-length encoded string, An efficient algorithm to test square-freeness of strings compressed by straight-line programs, Approximation of grammar-based compression via recompression, Leaf languages and string compression, A \textit{really} simple approximation of smallest grammar, Efficient algorithms to compute compressed longest common substrings and compressed palindromes, The complexity of compressing subsegments of images described by finite automata, On the complexity of pattern matching for highly compressed two-dimensional texts., Collage system: A unifying framework for compressed pattern matching., On stricter reachable repetitiveness measures, Computing longest palindromic substring after single-character or block-wise edits, The complexity of compressed membership problems for finite automata, Compressed automata for dictionary matching, Tree compression with top trees, A PTIME-complete matching problem for SLP-compressed words, Equality Testing of Compressed Strings
Cites Work
