Computing Lexicographic Parsings
| dc.contributor.author | Köppl, Dominik | |
| dc.date.accessioned | 2020-02-24T09:24:16Z | |
| dc.date.available | 2020-02-24T09:24:16Z | |
| dc.date.issued | 2019-12-18 | |
| dc.description.abstract | We give a memory-friendly algorithm computing the compression scheme plcpcomp or lex-parse in linear or near-linear time. | en |
| dc.identifier.uri | http://hdl.handle.net/2003/38856 | |
| dc.identifier.uri | http://dx.doi.org/10.17877/DE290R-20775 | |
| dc.language.iso | en | de |
| dc.subject | compression algorithms | en |
| dc.subject | lossless compression | en |
| dc.subject.ddc | 004 | |
| dc.title | Computing Lexicographic Parsings | en |
| dc.type | Text | de |
| dc.type.publicationtype | report | de |
| dcterms.accessRights | open access | |
| eldorado.secondarypublication | false | de |