Data compression with long repeated strings-Reference-Cited by-同舟云学术

Data compression with long repeated strings

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

Author:

Bentley Jon,McIlroy Douglas

Publisher

Elsevier BV

Subject

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

Reference13 articles.

1. A corpus for the evaluation of lossless compression algorithms;Arnold,1997

2. B.S. Baker, On finding duplication and near-duplication in large software systems. In: Proceedings of Second IRRR Working Conference on Reverse Engineering, July 1995, pp. 86–95

3. Text Compression;Bell,1990

4. Unbounded length contexts for PPM;Cleary;Computer Journal,1997

5. Efficient randomized pattern-matching algorithms;Karp;IBM Journal of Research and Development,1987

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

1. A Byte Pattern Based Method for File Compression;Communications in Computer and Information Science;2019

2. PreDict;Proceedings of the 19th International Middleware Conference;2018-11-26

3. Shared dictionary compression in publish/subscribe systems;Proceedings of the 10th ACM International Conference on Distributed and Event-based Systems;2016-06-13

4. Compact Auxiliary Dictionaries for Incremental Compression of Large Repositories;Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management;2014-11-03

5. Selecting Data for Experiments: Past, Present and Future;Experimental Algorithms;2014