Computing Lempel-Ziv factorization online

DOI10.1007/978-3-642-32589-2_68MaRDI QIDQ2912777zbMATH OpenOpenAlexFDO

Authors Tatiana Starikovskaya

Publication date 25 September 2012

Published in Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32589-2_68

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Algorithms on strings (68W32)

Recommendations

• Faster compact on-line Lempel-Ziv factorization
• Lempel-Ziv factorization powered by space efficient suffix trees
• Lempel-Ziv factorization using less time \& space
• Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
• Lempel Ziv computation in small space (LZ-CISS)

Cited in

(15)

• Off-line and on-line algorithms for closed string factorization
• Lempel Ziv computation in small space (LZ-CISS)
• LZD factorization: simple and practical online grammar compression with variable-to-fixed encoding
• Faster lightweight Lempel-Ziv parsing
• Lempel-Ziv factorization may be harder than computing all runs
• Faster compact on-line Lempel-Ziv factorization
• Lempel-Ziv Factorization Revisited
• An Online Algorithm for Finding the Longest Previous Factors
• Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
• Sublinear time Lempel-Ziv (LZ77) factorization
• New advances in rightmost Lempel-Ziv
• Tight bounds for compressing substring samples
• Maintaining the size of LZ77 on semi-dynamic strings
• Lempel-Ziv factorization powered by space efficient suffix trees
• Lempel-Ziv factorization using less time \& space

This page was built for publication: Computing Lempel-Ziv factorization online

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2912777)