scientific article; zbMATH DE number 764405

MaRDI QIDQ4836291zbMATH OpenFDO

Authors József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger

Publication date 25 July 1995

zbMATH Keywords

data compressionencodinggreedy algorithmstext-compression

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computing methodologies for text processing; mathematical typography (68U15) Source coding (94A29)

Recommendations

• Greedy Algorithms for On-Line Data Compression
• A worst-case analysis of the LZ2 compression algorithm
• The fractional greedy algorithm for data compression
• An analysis of the longest match and the greedy heuristics in text encoding
• scientific article; zbMATH DE number 1187116

Cited in

(7)

• The fractional greedy algorithm for data compression
• scientific article; zbMATH DE number 1615282 (Why is no real title available?)
• scientific article; zbMATH DE number 1187116 (Why is no real title available?)
• An analysis of the longest match and the greedy heuristics in text encoding
• Greedy Algorithms for On-Line Data Compression
• An on-line universal lossy data compression algorithm via continuous codebook refinement. I. Basic results
• Worst-case analysis for on-line data compression

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4836291)