Compressing interactive communication under product distributions
From MaRDI portal
Publication:4637503
Recommendations
Cites work
- scientific article; zbMATH DE number 2038719 (Why is no real title available?)
- A Mathematical Theory of Communication
- An information statistics approach to data stream and communication complexity
- Elements of Information Theory
- Exponential separation of communication and external information
- How to compress asymmetric communication
- How to compress interactive communication
- Information Equals Amortized Communication
- Interactive Information Complexity
- Interactive compression for product distributions
- Internal Compression of Protocols to Entropy
- Parallel repetition: simplification and the no-signaling case
- Probabilistic methods for algorithmic discrete mathematics
- The Communication Complexity of Correlation
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Towards a reverse Newman's theorem in interactive information complexity
Cited in
(10)- The communication complexity of functions with large outputs
- How to compress interactive communication
- How to compress interactive communication
- Interactive compression to external information
- Exponential separation of communication and external information
- Simplified separation of information and communication
- The work of Mark Braverman
- A candidate for a strong separation of information and communication
- Interactive compression for product distributions
- Interactive compression for multi-party protocol
This page was built for publication: Compressing interactive communication under product distributions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4637503)
