Author:
Békési J.,Galambos G.,Pferschy U.,Woeginger G. J.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Numerical Analysis,Theoretical Computer Science,Software
Reference5 articles.
1. Békési, J., Galambos G., Pferschy, U., Woeginger, G. J.: Greedy algorithms for on-line data compression. Report 276-93, Mathematical Institute, TU Graz, Austria 1993.
2. Gonzalez-Smith, M. E., Storer, J. A.: Parallel algorithms for data compression. J. ACM32, 344–373 (1985).
3. Katajainen, J., Raita, T.: An analysis of the longest matching and the greedy heuristic in text encoding. J. ACM39, 281–294 (1992).
4. Schuegraf, E. J., Heaps, H. S.: A comparison of algorithms for data base compression by use of fragments as language elements. Inf. Stor. Ret.10, 309–319 (1974).
5. Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory23, 337–343 (1977).
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Data Compression;Database and Data Communication Network Systems;2002
2. Worst-case analysis of the Iterated Longest Fragment algorithm;Information Processing Letters;2001-07
3. Longest Fragment First Algorithms for Data Compression;New Trends in Mathematical Programming;1998
4. Greedy Algorithms for On-Line Data Compression;Journal of Algorithms;1997-11