On data structures and asymmetric communication complexity
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The linear-array conjecture in communication complexity is false
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Direct product results and the GCD problem, in old and new communication models
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The cost of the missing bit: communication complexity with help
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The communication complexity of pointer chasing: applications of entropy and sampling
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On quantum and probabilistic communication: Las Vegas and one-way protocols
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
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
Randomized Simultaneous Messages: Solution Of A Problem Of Yao In Communication Complexity
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Information Processing Letters
Machine models and lower bounds for query processing
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computational Complexity
Theoretical Computer Science
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
A property of quantum relative entropy with an application to privacy in quantum communication
Journal of the ACM (JACM)
Improved Separations between Nondeterministic and Randomized Multiparty Communication
ACM Transactions on Computation Theory (TOCT)
Information Processing Letters
A direct sum theorem in communication complexity via message compression
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Towards polynomial lower bounds for dynamic problems
Proceedings of the forty-second ACM symposium on Theory of computing
A tight unconditional lower bound on distributed randomwalk computation
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The hardness of median in the synchronized bit communication model
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Trading bit, message, and time complexity of distributed algorithms
DISC'11 Proceedings of the 25th international conference on Distributed computing
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
Trade-Offs Between Time, Space, Cooperation, and Communication Complexity for CD Grammar Systems
Fundamenta Informaticae
Separating deterministic from nondeterministic nof multiparty communication complexity
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Lower bounds for quantile estimation in random-order and multi-pass streaming
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
From information to exact communication
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hadamard tensors and lower bounds on multiparty communication complexity
Computational Complexity
Optimal Collapsing Protocol for Multiparty Pointer Jumping
Theory of Computing Systems
Hi-index | 0.00 |