Communication complexity and quasi randomness

The cost of the missing bit: communication complexity with help

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing

Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing

Hypergraphs, quasi-randomness, and conditions for regularity

Journal of Combinatorial Theory Series A

A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness

Computational Complexity

Improved Separations between Nondeterministic and Randomized Multiparty Communication

APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques

Guest Column: correlation bounds for polynomials over {0 1}

ACM SIGACT News

Guest column: additive combinatorics and theoretical computer science

ACM SIGACT News

Improved Separations between Nondeterministic and Randomized Multiparty Communication

ACM Transactions on Computation Theory (TOCT)

On the Power of Small-Depth Computation

Foundations and Trends® in Theoretical Computer Science

Silence-based communication

IEEE Transactions on Information Theory

The story of set disjointness

ACM SIGACT News

Lower bounds for circuits with few modular and symmetric gates

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Hadamard tensors and lower bounds on multiparty communication complexity

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

NOF-multiparty information complexity bounds for pointer jumping

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science

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

Separating deterministic from nondeterministic nof multiparty communication complexity

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming

Shielding circuits with groups

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

Hadamard tensors and lower bounds on multiparty communication complexity

Computational Complexity