Worst-case analysis for on-line data compression

DOI10.1007/3-540-61576-8_90MaRDI QIDQ6567689zbMATH OpenFDO

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

Publication date 5 July 2024

Full work available at URL https://doi.org/10.1007/3-540-61576-8_90

zbMATH Keywords

data compressiononline algorithmworst-case analysis

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)

Recommendations

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

Cites work

• scientific article; zbMATH DE number 3468267 (Why is no real title available?)
• A universal algorithm for sequential data compression
• An analysis of the longest match and the greedy heuristics in text encoding
• Parallel algorithms for data compression

This page was built for publication: Worst-case analysis for on-line data compression

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