Worst-case analysis of the Iterated Longest Fragment algorithm

Authors:
József Békési;Gábor Galambos
Affiliations:
University of Szeged, Hungary;University of Szeged, Hungary
Venue:
Information Processing Letters
Year:
2001

Citing 5
Cited 0

An analysis of the longest match and the greedy heuristics in text encoding

Journal of the ACM (JACM)
The fractional greedy algorithm for data compression

Computing
On-line longest fragment first parsing algorithm

Information Processing Letters
Greedy algorithms for on-line data compression

Journal of Algorithms
PRAM Algorithms for Static Dictionary Compression

Proceedings of the 8th International Symposium on Parallel Processing

Quantified Score

Hi-index	0.89

Visualization

Abstract

For parallel machine architecture the Iterated Longest Fragment algorithm was investigated by Stauffer and Hirschberg [Proc. 8th Int. Parallel Process. Symp., 1994, pp. 344-348] for compressing a text with a static dictionary. Later Nagumo, Lu and Watson [Inform. Process. Lett. 59 (1996) 91-96] proved that the algorithm can be implemented in an on-line way for the classical architecture as well. Beside some experimental results the efficiency of the algorithm has not been analyzed yet. In this paper we will investigate the asymptotic worst-case behaviour of the ILF algorithm for several types of static dictionaries. 2001 Elsevier Science B.V. All rights reserved.