Multiparty Communication Complexity: Very Hard Functions
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Partition Arguments in Multiparty Communication Complexity
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Lower bounds for number-in-hand multiparty communication complexity, made easy
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Tight bounds for distributed functional monitoring
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |