Exponential separation of quantum and classical communication complexity
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Quantum lower bounds by quantum arguments
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Interaction in quantum communication and the complexity of set disjointness
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On communication over an entanglement-assisted quantum channel
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Quantum communication and complexity
Theoretical Computer Science - Natural computing
Improved Quantum Communication Complexity Bounds for Disjointness and Equality
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Quantum lower bounds by quantum arguments
Journal of Computer and System Sciences - Special issue on STOC 2000
Optimal Lower Bounds for Quantum Automata and Random Access Codes
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Bounds for Small-Error and Zero-Error Quantum Algorithms
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Quantum communication complexity of block-composed functions
Quantum Information & Computation
Universally composable privacy amplification against quantum adversaries
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Towards characterizing the non-locality of entangled quantum states
Theoretical Computer Science
| Hi-index | 0.00 |