4 research outputs found
P-complete problems in data compression
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
Lempel-Ziv Data Compression on Parallel and Distributed Systems
We present a survey of results concerning Lempel-Ziv data compression on parallel and distributed systems, starting from the theoretical approach to parallel time complexity to conclude with the practical goal of designing distributed algorithms with low communication cost. An extension by Storer to image compression is also discussed