Linear Algorithm for Data Compression via String Matching
Journal of the ACM (JACM)
Data compression via textual substitution
Journal of the ACM (JACM)
Common phrases and minimum-space text storage
Communications of the ACM
Introduction to VLSI Systems
Bounds on minimax edge length for complete binary trees
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
A VLSI chip for efficient transmission and retrieval of information
SIGIR '87 Proceedings of the 10th annual international ACM SIGIR conference on Research and development in information retrieval
Systolic implementations of a move-to-front text compressor
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
ACM Computing Surveys (CSUR)
Systolic implementations of a move-to-front text compressor
ACM SIGARCH Computer Architecture News - Symposium on parallel algorithms and architectures
An analysis of the longest match and the greedy heuristics in text encoding
Journal of the ACM (JACM)
Practical dictionary management for hardware data compression
Communications of the ACM
The relationship between greedy parsing and symbolwise text compression
Journal of the ACM (JACM)
Systolic Self-Organizing Lists Under Transpose
IEEE Transactions on Parallel and Distributed Systems
Optimal parallel dictionary matching and compression (extended abstract)
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
On the optimality of parsing in dynamic dictionary based data compression
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A multiple processor approach to data compression
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Parallel Parsing Algorithms for Static Dictionary Compression
IEEE Transactions on Parallel and Distributed Systems
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
DCC '00 Proceedings of the Conference on Data Compression
The effect of non-greedy parsing in Ziv-Lempel compression methods
DCC '95 Proceedings of the Conference on Data Compression
The Effect of Flexible Parsing for Dynamic Dictionary-Based Data Compression
Journal of Experimental Algorithmics (JEA)
Design and Implementation of a Lossless Parallel High-Speed Data Compression System
IEEE Transactions on Parallel and Distributed Systems
Software and hardware enhancement of arithmetic coding
SSDBM'1988 Proceedings of the 4th international conference on Statistical and Scientific Database Management
Discrete Applied Mathematics - 12th annual symposium on combinatorial pattern matching (CPM)
Stateful hardware decompression in networking environment
Proceedings of the 4th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
On the bit-complexity of Lempel-Ziv compression
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Discrete Applied Mathematics
Using transparent compression to improve SSD-based I/O caches
Proceedings of the 5th European conference on Computer systems
Transparent Online Storage Compression at the Block-Level
ACM Transactions on Storage (TOS)
| Hi-index | 0.02 |
Parallel algorithms for data compression by textual substitution that are suitable for VLSI implementation are studied. Both “static” and “dynamic” dictionary schemes are considered.