A taxonomy of problems with fast parallel algorithms
Information and Control
Data compression: methods and theory
Data compression: methods and theory
Complexity theory of parallel time and hardware
Information and Computation
Text compression
Efficient parallel algorithms to test square-freeness and factorize strings
Information Processing Letters
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
P-complete problems in data compression
Theoretical Computer Science
Multilist layering: complexity and applications
Theoretical Computer Science
Limits to parallel computation: P-completeness theory
Limits to parallel computation: P-completeness theory
Relations Among Complexity Measures
Journal of the ACM (JACM)
Erratum to “P-complete problems in data compression” [Theoret. Comput. Sci. 127 (1994) 181-186]
Theoretical Computer Science
Image and Text Compression
Optimal Parallel Algorithms for Problems Modeled by a Family of Intervals
IEEE Transactions on Parallel and Distributed Systems
Deterministic CFL's are accepted simultaneously in polynomial time and log squared space
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We study the parallel complexity of a bounded size dictionary version (LRU deletion heuristic) of the LZ2 compression algorithm. The unbounded version was shown to be P-complete. When the size of the dictionary is O(logk n), the problem of computing the LZ2 compression is shown to be hard for the class of problems solvable simultaneously in polynomial time and O(logk n) space (that is, SCk). We also introduce a variation of this heuristic that turns out to be an SCk-complete problem (the original heuristic belongs to SCk+1). In virtue of these results, we argue that there are no practical parallel algorithms for LZ2 compression with LRU deletion heuristic or any other heuristic deleting dictionary elements in a continuous way. For simpler heuristics (SWAP, RESTART, FREEZE), practical parallel algorithms are given.