Randomized Communication Protocols (A Survey)
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
The Communication Complexity of Approximate Set Packing and Covering
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
ACM SIGACT News
An optimal lower bound on the communication complexity of gap-hamming-distance
Proceedings of the forty-third annual ACM symposium on Theory of computing
Tight bounds for distributed functional monitoring
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Choosing, Agreeing, and Eliminating in Communication Complexity
Computational Complexity
| Hi-index | 0.00 |