239 search results - page 1 / 48 » A Simple Algorithm for Computing the Lempel Ziv Factorizatio... |
DCC
2008
IEEE
14 years 3 months ago
2008
IEEE
We give a space-efficient simple algorithm for computing the Lempel?Ziv factorization of a string. For a string of length n over an integer alphabet, it runs in O(n) time independ...
IPL
2008
13 years 4 months ago
2008
We give two optimal linear-time algorithms for computing the Longest Previous Factor (LPF) array corresponding to a string w. For any position i in w, LPF[i] gives the length of th...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern match...
SOFSEM
2009
Springer
14 years 1 months ago
2009
Springer
This paper considers online compression algorithms that use at most polylogarithmic space (plogon). These algorithms correspond to compressors in the data stream model. We study th...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
The pressing need for efficient compression schemes for XML documents has recently been focused on stack computation [6, 9], and in particular calls for a formulation of informati...