Parallelism and dictionary based data compression-Reference-Cited by-同舟云学术

Parallelism and dictionary based data compression

Published:2001-06 Issue:1-2 Volume:135 Page:43-56
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

De Agostino Sergio

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference27 articles.

1. Parallel construction of a suffix tree with applications;Apostolico;Algorithmica,1988

2. D. Belinskaya, S. De Agostino, J.A. Storer, Near optimal compression with respect to a static dictionary on a practical massively parallel architecture, in: Proceedings of the IEEE Data Compression Conference, 1995, pp. 172–181

3. Text Compression;Bell,1990

4. M. Cohn, R. Khazan, Parsing with suffix and prefix dictionaries, in: Proceedings of the IEEE Data Compression Conference, 1996, pp. 180–189

5. Efficient parallel algorithms to test square-freeness and factorize strings;Crochemore;Inf. Process. Lett.,1991

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Greedy versus optimal analysis of bounded size dictionary compression and on-the-fly distributed computing;Discrete Applied Mathematics;2024-01

2. Empirical evaluation of LZW-Compressed Multiple Pattern Matching Algorithms;2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC);2022-09

3. Performance analysis of data compression algorithms for heterogeneous architecture through parallel approach;The Journal of Supercomputing;2018-07-14

4. The greedy approach to dictionary-based static text compression on a distributed system;Journal of Discrete Algorithms;2015-09

5. Lempel–Ziv Data Compression on Parallel and Distributed Systems;Algorithms;2011-09-14