On the size of overlapping Lempel-Ziv and Lyndon factorizations (Q5088921): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
label / enlabel / en
 
On the size of overlapping Lempel-Ziv and Lyndon factorizations
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diverse Palindromic Factorization is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The “Runs” Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Palindromic length in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lempel-Ziv factorization using less time \& space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free differential calculus. IV: The quotient groups of the lower central series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a Solution to the “Runs” Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal computation of runs over general alphabet via non-crossing LCE queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Prefix/Suffix-Square Free Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subquadratic algorithm for minimum palindromic factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Longest Common Extension Queries in Strings over General Alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Lyndon factorization algorithms for SLP and LZ78 compressed text / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Palindromic Factorizations and Palindromic Covers On-line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4636645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934345 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing runs on a general alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorizing a String into Squares in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of Lempel-Ziv factorization to the approximation of grammar-based compression. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A universal algorithm for sequential data compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compression of individual sequences via variable-rate coding / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.4230/LIPIcs.CPM.2019.29 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2954309532 / rank
 
Normal rank
Property / title
 
On the size of overlapping Lempel-Ziv and Lyndon factorizations (English)
Property / title: On the size of overlapping Lempel-Ziv and Lyndon factorizations (English) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:01, 30 July 2024

scientific article; zbMATH DE number 7559197
Language Label Description Also known as
English
On the size of overlapping Lempel-Ziv and Lyndon factorizations
scientific article; zbMATH DE number 7559197

    Statements

    0 references
    0 references
    0 references
    0 references
    0 references
    18 July 2022
    0 references
    Lyndon factorization
    0 references
    Lyndon words
    0 references
    Lempel-Ziv factorization
    0 references
    On the size of overlapping Lempel-Ziv and Lyndon factorizations (English)
    0 references

    Identifiers