Worst-case analysis of the iterated longest fragment algorithm

DOI10.1016/S0020-0190(00)00185-XzbMath1051.68073OpenAlexW2091750112MaRDI QIDQ1603464

Gábor Galambos, József Békési

Publication date: 14 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(00)00185-x

zbMATH Keywords

AlgorithmsAnalysis of algorithmsData compressionOn-line heuristics

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On-line longest fragment first parsing algorithm
• The fractional greedy algorithm for data compression
• Arithmetic Coding
• An analysis of the longest match and the greedy heuristics in text encoding
• Greedy Algorithms for On-Line Data Compression
• A Method for the Construction of Minimum-Redundancy Codes

This page was built for publication: Worst-case analysis of the iterated longest fragment algorithm