Faster Lightweight Lempel-Ziv Parsing (Q2946413)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Faster Lightweight Lempel-Ziv Parsing	scientific article

Statements

scholarly article

0 references

Faster Lightweight Lempel-Ziv Parsing (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-662-48054-0_36

0 references

Dmitry Kosolobov

0 references

Mathematical Foundations of Computer Science 2015

0 references

publication date

16 September 2015

0 references

full work available at URL

https://arxiv.org/abs/1504.06712

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

Succinct Dictionary Matching with No Slowdown

0 references

Computing the longest common prefix array based on the Burrows-Wheeler transform

0 references

0 references

0 references

Fast Lightweight Suffix Array Construction and Checking

0 references

Lempel Ziv Computation in Small Space (LZ-CISS)

0 references

Deterministic Dictionaries

0 references

0 references

Lempel-Ziv Factorization May Be Harder Than Computing All Runs

0 references

On the Complexity of Finite Sequences

0 references

Fully Functional Static and Dynamic Succinct Trees

0 references

Lempel-Ziv Factorization Revisited

0 references

An Online Algorithm for Finding the Longest Previous Factors

0 references

Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets

0 references

Computing Lempel-Ziv Factorization Online

0 references

Faster Compact On-Line Lempel-Ziv Factorization

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2946413

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2946413&oldid=36201238"