| Publication | Date of Publication | Type |
|---|
| Quantum and classical strong direct product theorems and optimal time-space tradeoffs | 2026-05-29 | Paper |
| Lower bounds for quantum communication complexity | 2026-05-08 | Paper |
A hierarchy of constant communication complexity
Information and Computation | 2026-03-20 | Paper |
The Power of One Clean Qubit in Communication Complexity
(available as arXiv preprint) | 2023-08-08 | Paper |
| The complexity of quantum disjointness | 2020-05-26 | Paper |
Quadratically tight relations for randomized query complexity
Theory of Computing Systems | 2020-02-27 | Paper |
Quadratically tight relations for randomized query complexity
Lecture Notes in Computer Science | 2018-11-28 | Paper |
Distributed computation of large-scale graph problems
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Correlation in Hard Distributions in Communication Complexity
(available as arXiv preprint) | 2017-08-31 | Paper |
Streaming computations with a loquacious prover
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
New bounds for the garden-hose model
(available as arXiv preprint) | 2017-04-25 | Paper |
Fooling one-sided quantum protocols
(available as arXiv preprint) | 2017-01-30 | Paper |
New bounds on the classical and quantum communication complexity of some graph properties
(available as arXiv preprint) | 2017-01-26 | Paper |
Equality, revisited
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Can quantum communication speed up distributed computation?
Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
Interaction in quantum communication and the complexity of \textsc{Set Disjointness}
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Two results about quantum messages
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
On quantum and probabilistic communication: Las Vegas and one-way protocols
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
A strong direct product theorem for disjointness
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
An improved interactive streaming algorithm for the distinct elements problem
Automata, Languages, and Programming | 2014-07-01 | Paper |
Optimal direct sum results for deterministic and randomized decision tree complexity
Information Processing Letters | 2012-03-27 | Paper |
Quantum time-space tradeoffs for sorting
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Depth-independent lower bounds on the communication complexity of read-once Boolean formulas
Lecture Notes in Computer Science | 2010-07-20 | Paper |
| scientific article; zbMATH DE number 5485573 (Why is no real title available?) | 2009-01-05 | Paper |
Interaction in Quantum Communication
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
One-Way Communication Complexity and the Nečiporuk Lower Bound on Formula Size
SIAM Journal on Computing | 2008-04-22 | Paper |
Lower Bounds for Quantum Communication Complexity
SIAM Journal on Computing | 2008-03-28 | Paper |
Quantum and Classical Strong Direct Product Theorems and Optimal Time‐Space Tradeoffs
SIAM Journal on Computing | 2007-10-22 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Individual communication complexity
Journal of Computer and System Sciences | 2007-08-23 | Paper |
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2005-08-12 | Paper |
Quantum and approximate privacy
Theory of Computing Systems | 2005-01-25 | Paper |
| scientific article; zbMATH DE number 2086397 (Why is no real title available?) | 2004-08-11 | Paper |
Algorithms for Parity Games
Lecture Notes in Computer Science | 2003-07-16 | Paper |
Communication complexity method for measuring nondeterminism in finite automata
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1670824 (Why is no real title available?) | 2001-11-11 | Paper |
| scientific article; zbMATH DE number 1335889 (Why is no real title available?) | 1999-09-13 | Paper |
On the hardness of global and local approximation
Algorithm Theory — SWAT'96 | 1998-02-08 | Paper |
