Name
Abstract | ||
|---|---|---|
The LZ2 compression method is hardly parallelizable since it is known to be P-complete. In spite of such negative result, we show in this paper that the decoding process can be parallelized efficiently on an EREW PRAM model of computation with O ( n /log( n )) processors and O (log 2 n ) time, where n is the length of the output string. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1016/0167-8191(95)01030-0 | Parallel Computing |
Keywords | Field | DocType |
textual substitution,decoding,lz2 data compression,compression algorithm,parallel decoding algorithm,parallel algorithm,data compression,model of computation | Parallelizable manifold,Compression (physics),Parallel algorithm,Computer science,Parallel computing,Theoretical computer science,Model of computation,Decoding methods,Data compression | Journal |
Volume | Issue | ISSN |
21 | 12 | Parallel Computing |
Citations | PageRank | References |
7 | 0.72 | 7 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sergio De Agostino | 1 | 102 | 16.51 |