AbstractIn this paper we study the parallel computational complexity of some methods for compressing data via textual substitution. We show that the Ziv-Lempel algorithm and two standard variations are P-complete. Hence an efficient parallelization of these algorithms is not possible unless P = NC
How to solve string problems, if instead of input string we get only program generating it? Is it p...
Abstract. Countless variants of the Lempel-Ziv compression are widely used in many real-life applica...
AbstractWe present the first nontrivial algorithm for approximate pattern matching on compressed tex...
AbstractIn this paper we study the parallel computational complexity of some methods for compressing...
AbstractWe study the parallel complexity of a bounded size dictionary version (LRU deletion heuristi...
We consider several basic problems for texts and show that if the input texts are given by their Lem...
One of the most famous and investigated lossless data-compression schemes is the one introduced by L...
Abstract: In the age of big data, the need for efficient data compression algorithms has grown. A wi...
We address parallel and high-speed lossless data compression. Data compression attempts to reduce th...
This paper considers online compression algorithms that use at most polylogarithmic space (plogon)....
AbstractWe explore the possibility of using multiple processors to improve the encoding and decoding...
. We survey the complexity issues related to several algorithmic problems for compressed one- and tw...
Parallel algorithms for lossless data compression via dictionary compression using optimal, longest ...
We present work-optimal PRAM algorithms for Burrows-Wheeler compression and decompression of string...
We consider the problem of decompressing the Lempel-Ziv 77 representation of a string S of length n ...
How to solve string problems, if instead of input string we get only program generating it? Is it p...
Abstract. Countless variants of the Lempel-Ziv compression are widely used in many real-life applica...
AbstractWe present the first nontrivial algorithm for approximate pattern matching on compressed tex...
AbstractIn this paper we study the parallel computational complexity of some methods for compressing...
AbstractWe study the parallel complexity of a bounded size dictionary version (LRU deletion heuristi...
We consider several basic problems for texts and show that if the input texts are given by their Lem...
One of the most famous and investigated lossless data-compression schemes is the one introduced by L...
Abstract: In the age of big data, the need for efficient data compression algorithms has grown. A wi...
We address parallel and high-speed lossless data compression. Data compression attempts to reduce th...
This paper considers online compression algorithms that use at most polylogarithmic space (plogon)....
AbstractWe explore the possibility of using multiple processors to improve the encoding and decoding...
. We survey the complexity issues related to several algorithmic problems for compressed one- and tw...
Parallel algorithms for lossless data compression via dictionary compression using optimal, longest ...
We present work-optimal PRAM algorithms for Burrows-Wheeler compression and decompression of string...
We consider the problem of decompressing the Lempel-Ziv 77 representation of a string S of length n ...
How to solve string problems, if instead of input string we get only program generating it? Is it p...
Abstract. Countless variants of the Lempel-Ziv compression are widely used in many real-life applica...
AbstractWe present the first nontrivial algorithm for approximate pattern matching on compressed tex...
DOI
Add to ORKG