Optimal Parsing of Strings

Alan Hartman, Michael Rodeh

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

Parsing of strings has been suggested by Lempel and Ziv, as a tool to define the complexity of strings [LZ1] and to compress them [ZL1, ZL2]. Recently, they have shown that the scheme may be modified to handle two dimensional data [LZ2].
Original languageEnglish
Title of host publicationCombinatorial Algorithms on Words
EditorsA. Apostolico, Z. Galil
PublisherSpringer
Pages155-167
Number of pages13
ISBN (Electronic)978-3-642-82456-2
ISBN (Print)978-3-642-82458-6
DOIs
StatePublished - 1985
Externally publishedYes

Fingerprint

Dive into the research topics of 'Optimal Parsing of Strings'. Together they form a unique fingerprint.

Cite this