Deterministic compression with uncertain priors

DOI10.1007/s00453-015-0107-6zbMath1353.68075arXiv1211.5718OpenAlexW2399515726MaRDI QIDQ5891037

Elad Haramaty, Madhu Sudan

Publication date: 29 November 2016

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1211.5718

zbMATH Keywords

graph coloringcommunication complexitysource coding

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Coloring of graphs and hypergraphs (05C15) Source coding (94A29)

Related Items (1)

Coloring chains for compression with uncertain priors

Cites Work

• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Deterministic coin tossing with applications to optimal parallel list ranking
• Locality in Distributed Graph Algorithms
• A universal algorithm for sequential data compression
• Communication Complexity
• The Communication Complexity of Correlation
• A theory of goal-oriented communication
• Information Equals Amortized Communication

This page was built for publication: Deterministic compression with uncertain priors