Show simple item record

dc.contributor.authorCrochemore, M.
dc.contributor.authorIlie, L.
dc.contributor.authorSmyth, William
dc.contributor.editorStorer, James A. and Marcellin, Michael W.
dc.identifier.citationCrochemore, Maxime and Ilie, Lucian and Smyth, William Fennel. 2008. A simple algorithm for computing the Lempel-Ziv factorization, in Storer, J. and Marcellin, M. (ed), 18th Data Compression Conference (DCC 2008), Mar 25 2008, pp. 482-488. Utah, USA: IEEE Computer Society.

We give a space-efficient simple algorithm for computing the Lempel?Ziv factorization ofa string. For a string of length n over an integer alphabet, it runs in O(n) time independentlyof alphabet size and uses o(n) additional space.

dc.publisherIEEE Computer Society
dc.titleA simple algorithm for computing the Lempel-Ziv factorization
dc.typeConference Paper
dcterms.source.titleProceedings of the 18th data compression conference (DCC 2008)
dcterms.source.seriesProceedings of the 18th data compression conference (DCC 2008)
dcterms.source.conference18th Data Compression Conference (DCC 2008)
dcterms.source.conference-start-date25 Mar 2008
dcterms.source.conferencelocationUtah, USA

Copyright © 2008 IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

curtin.accessStatusOpen access
curtin.facultyCurtin Business School
curtin.facultyCentre for Extended Enterprises and Business Intelligence
curtin.facultySchool of Information Systems

Files in this item


This item appears in the following Collection(s)

Show simple item record