scientific article; zbMATH DE number 7250149
From MaRDI portal
Publication:5121897
Recommendations
Cites work
- An information complexity approach to extended formulations
- An information statistics approach to data stream and communication complexity
- Beyond set disjointness: the communication complexity of finding the intersection
- Certifying equality with limited interaction
- Communication Complexity
- Communication complexity of set-disjointness for all probabilities
- Depth-independent lower bounds on the communication complexity of read-once Boolean formulas
- From information to exact communication
- scientific article; zbMATH DE number 6687761 (Why is no real title available?)
- scientific article; zbMATH DE number 6789270 (Why is no real title available?)
- scientific article; zbMATH DE number 6292622 (Why is no real title available?)
- Information Equals Amortized Communication
- Lower bounds on the randomized communication complexity of read-once functions
- On the distributional complexity of disjointness
- Rectangles Are Nonnegative Juntas
- The communication complexity of gap Hamming distance
- The landscape of communication complexity classes
- Tribes is hard in the message passing model
- Two applications of information complexity
Cited in
(6)- On the streaming indistinguishability of a random permutation and a random function
- Communication complexity with small advantage
- Communication complexity of key agreement on small ranges
- scientific article; zbMATH DE number 7650118 (Why is no real title available?)
- The communication complexity of functions with large outputs
- Correction to: ``Communication complexity with small advantage
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5121897)
