On Information Complexity in the Broadcast Model

DOI10.1145/2767386.2767425zbMath1333.68048OpenAlexW2045131847MaRDI QIDQ2796271

Rotem Oshman, Mark Braverman

Publication date: 23 March 2016

Published in: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2767386.2767425

zbMATH Keywords

compressioninformation complexitycommunication complexityset disjointness

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (3)

Unnamed Item ⋮ The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model ⋮ Multi-party threshold private set intersection with sublinear communication

Cites Work

• Memorization and Association on a Realistic Neural Model
• Unnamed Item

This page was built for publication: On Information Complexity in the Broadcast Model