Faster Lyndon factorization algorithms for SLP and LZ78 compressed text (Q507399): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Fast parallel Lyndon factorization with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Converting SLP to LZ78 in almost Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The level ancestor problem simplified / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lyndon + Christoffel = digitally convex / 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: Parallel RAM algorithms for factorizing words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorizing words over an ordered alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2904799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting regularities on grammar-compressed strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Lyndon Factorization of Grammar Compressed Text / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compression of individual sequences via variable-rate coding / rank
 
Normal rank

Revision as of 08:54, 13 July 2024

scientific article
Language Label Description Also known as
English
Faster Lyndon factorization algorithms for SLP and LZ78 compressed text
scientific article

    Statements

    Identifiers