Full metadata record
DC FieldValueLanguage
dc.contributor.authorKöppl, Dominik-
dc.date.accessioned2020-02-24T09:24:16Z-
dc.date.available2020-02-24T09:24:16Z-
dc.date.issued2019-12-18-
dc.identifier.urihttp://hdl.handle.net/2003/38856-
dc.identifier.urihttp://dx.doi.org/10.17877/DE290R-20775-
dc.description.abstractWe give a memory-friendly algorithm computing the compression scheme plcpcomp or lex-parse in linear or near-linear time.en
dc.language.isoende
dc.subjectcompression algorithmsen
dc.subjectlossless compressionen
dc.subject.ddc004-
dc.titleComputing Lexicographic Parsingsen
dc.typeTextde
dc.type.publicationtypereportde
dcterms.accessRightsopen access-
eldorado.secondarypublicationfalsede
Appears in Collections:LS 11

Files in This Item:
File Description SizeFormat 
lexparse.pdfDNB280.24 kBAdobe PDFView/Open


This item is protected by original copyright



This item is protected by original copyright rightsstatements.org