Efficient parallel algorithms
Text compression
Online adaptive vector quantization with variable size codebook entries
Information Processing and Management: an International Journal - Special issue: data compression
Parallel Algorithms for the Longest Common Subsequence Problem
IEEE Transactions on Parallel and Distributed Systems
PRAM Algorithms for Static Dictionary Compression
Proceedings of the 8th International Symposium on Parallel Processing
Parallel Parsing Algorithms for Static Dictionary Compression
IEEE Transactions on Parallel and Distributed Systems
Work-Optimal Parallel Decoders for LZ2 Data Compression
DCC '00 Proceedings of the Conference on Data Compression
DCC '95 Proceedings of the Conference on Data Compression
Massive Semantic Web data compression with MapReduce
Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing
Scalable RDF data compression with MapReduce
Concurrency and Computation: Practice & Experience
| Hi-index | 0.00 |
Studies parallel algorithms for two static dictionary compression strategies. One is the optimal dictionary compression with dictionaries that have the prefix property, for which our algorithm requires O(L+log n) time and O(n) processors, where L is the maximum allowable length of the dictionary entries, while previous results run in O(L+log n) time using O(n/sup 2/) processors, or in O(L+log/sup 2/n) time using O(n) processors. The other algorithm is the longest-fragment-first (LFF) dictionary compression, for which our algorithm requires O(L+log n) time and O(nL) processors, while the previous result has O(L log n) time performance on O(n/log n) processors. We also show that the sequential LFF dictionary compression can be computed online with a lookahead of length O(L/sup 2/)