Three results on interactive communication
From MaRDI portal
Recommendations
Cited in
(19)- A general 4-words inequality with consequences for 2-way communication complexity
- Tight bounds for synchronous communication of information using bits and silence
- Protocols for asymmetric communication channels
- On Slepian-Wolf theorem with interaction
- A communication-randomness tradeoff for two-processor systems
- Communication with imperfectly shared randomness
- scientific article; zbMATH DE number 4191079 (Why is no real title available?)
- Worst Case Nonzero-Error Interactive Communication
- Interactive Communication of Balanced Distributions and of Correlated Files
- Three messages are not optimal in worst case interactive communication
- On interactive communication
- Coding for computing
- Amortized Communication Complexity
- scientific article; zbMATH DE number 826048 (Why is no real title available?)
- Repeated communication and Ramsey graphs
- Amortized communication complexity of an equality predicate
- On Slepian-Wolf theorem with interaction
- Communication and information complexity
- Ning Cai's work on communication complexity
This page was built for publication: Three results on interactive communication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4307373)