Parallelism and dictionary based data compression
From MaRDI portal
Recommendations
Cites work
- A universal algorithm for sequential data compression
- An Efficient Parallel Biconnectivity Algorithm
- Compression of individual sequences via variable-rate coding
- Efficient parallel algorithms to test square-freeness and factorize strings
- scientific article; zbMATH DE number 3919857 (Why is no real title available?)
- scientific article; zbMATH DE number 176779 (Why is no real title available?)
- On the Complexity of Finite Sequences
- P-complete problems in data compression
- Parallel construction of a suffix tree with applications
Cited in
(15)- Hierarchical dictionary model and dictionary management policies for data compression
- P-complete problems in data compression
- Worst-case analysis of the iterated longest fragment algorithm
- Concurrent vs. exclusive reading in parallel decoding of LZ-compressed files
- Lempel-Ziv data compression on parallel and distributed systems
- Parallel Lempel Ziv coding
- The faster higher-order cellular automaton for hyper-parallel undistorted data compression
- Parallel algorithms for Burrows-Wheeler compression and decompression
- scientific article; zbMATH DE number 1946603 (Why is no real title available?)
- scientific article; zbMATH DE number 1786445 (Why is no real title available?)
- The greedy approach to dictionary-based static text compression on a distributed system
- MICAI 2004: Advances in Artificial Intelligence
- A hardware architecture for the LZW compression and decompression algorithms based on parallel dictionaries
- Greedy versus optimal analysis of bounded size dictionary compression and on-the-fly distributed computing
- Scalability and communication in parallel low-complexity lossless compression
This page was built for publication: Parallelism and dictionary based data compression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5944436)