LZ-End Parsing in Linear Time

Show full item record



Permalink

http://hdl.handle.net/10138/232539

Citation

Kempa , D & Kosolobov , D 2017 , LZ-End Parsing in Linear Time . in K Pruhs & C Sohler (eds) , 25th Annual European Symposium on Algorithms (ESA 2017) . , 53 , Leibniz International Proceedings in Informatics (LIPIcs) , vol. 87 , Schloss Dagstuhl - Leibniz-Zentrum für Informatik , European Symposia on Algorithms , Vienna , Austria , 04/09/2017 . https://doi.org/10.4230/LIPIcs.ESA.2017.53

Title: LZ-End Parsing in Linear Time
Author: Kempa, Dominik; Kosolobov, Dmitry
Other contributor: Pruhs, Kirk
Sohler, Christian
Contributor organization: Department of Computer Science
Combinatorial Pattern Matching research group / Esko Ukkonen
Helsinki Institute for Information Technology
Practical Algorithms and Data Structures on Strings research group / Juha Kärkkäinen
Finnish Centre of Excellence in Algorithmic Data Analysis Research (Algodan)
Genome-scale Algorithmics research group / Veli Mäkinen
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Date: 2017
Language: eng
Number of pages: 14
Belongs to series: 25th Annual European Symposium on Algorithms (ESA 2017)
Belongs to series: Leibniz International Proceedings in Informatics (LIPIcs)
ISBN: 978-3-95977-049-1
ISSN: 1868-8969
DOI: https://doi.org/10.4230/LIPIcs.ESA.2017.53
URI: http://hdl.handle.net/10138/232539
Subject: 113 Computer and information sciences
LZ-End
LZ77
construction algorithm
linear time
Peer reviewed: Yes
Rights: cc_by
Usage restriction: openAccess
Self-archived version: publishedVersion


Files in this item

Total number of downloads: Loading...

Files Size Format View
LIPIcs_ESA_2017_53.pdf 522.0Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record