Constructing set systems with prescribed intersection sizes
Journal of Algorithms
Quantum multiparty communication complexity and circuit lower bounds
Mathematical Structures in Computer Science
Languages with bounded multiparty communication complexity
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Quantum multiparty communication complexity and circuit lower bounds
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
IEEE Transactions on Information Theory
On the possibility of faster SAT algorithms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Hadamard tensors and lower bounds on multiparty communication complexity
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
The multiparty communication complexity of set disjointness
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The NOF multiparty communication complexity of composed functions
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Communication lower bounds using directional derivatives
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hadamard tensors and lower bounds on multiparty communication complexity
Computational Complexity
| Hi-index | 0.06 |