Communication with contextual uncertainty
From MaRDI portal
Publication:1616619
DOI10.1007/s00037-017-0161-3zbMath1403.68061arXiv1504.04813OpenAlexW3015210772MaRDI QIDQ1616619
Ilan Komargodski, Pravesh K. Kothari, Badih Ghazi, Madhu Sudan
Publication date: 7 November 2018
Published in: Computational Complexity, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.04813
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- An information statistics approach to data stream and communication complexity
- The communication complexity of the Hamming distance problem
- On randomized one-round communication complexity
- The Information Complexity Of Hamming Distance
- Massive online teaching to bounded learners
- Communication with Imperfectly Shared Randomness
- Communication Complexity of Permutation-Invariant Functions
- Communication Complexity
- The Communication Complexity of Correlation
- The Power of Shared Randomness in Uncertain Communication
- On the Role of Shared Randomness in Simultaneous Communication
- On Extracting Common Random Bits From Correlated Sources
- A theory of goal-oriented communication
- Probability and Computing
- Deterministic compression with uncertain priors
- Unnamed Item
- Unnamed Item
This page was built for publication: Communication with contextual uncertainty
