Worst-case analysis for on-line data compression

DOI10.1007/3-540-61576-8_90zbMATH Open1543.68113MaRDI QIDQ6567689

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

Publication date: 5 July 2024

zbMATH Keywords

data compressiononline algorithmworst-case analysis

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Parallel algorithms for data compression
• A universal algorithm for sequential data compression
• An analysis of the longest match and the greedy heuristics in text encoding

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)