On the distributional complexity of disjointness
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Amortized communication complexity (Preliminary version)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Communication complexity towards lower bounds on circuit depth
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Rounds in communication complexity revisited
SIAM Journal on Computing
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Error Reduction by Parallel Repetition - A Negative Result
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Towards proving strong direct product theorems
Computational Complexity
Parallel repetition: simplifications and the no-signaling case
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Parallel repetition in projection games and a concentration bound
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Chernoff-type direct product theorems
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Parallel repetition of the odd cycle game
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
A strong direct product theorem for disjointness
Proceedings of the forty-second ACM symposium on Theory of computing
Constructive proofs of concentration bounds
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Strong direct product theorems for quantum communication and query complexity
Proceedings of the forty-third annual ACM symposium on Theory of computing
Quantum and classical communication-space tradeoffs from rectangle bounds
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Parallel Repetition in Projection Games and a Concentration Bound
SIAM Journal on Computing
Direct product via round-preserving compression
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Derandomized Parallel Repetition Theorems for Free Games
Computational Complexity
Choosing, Agreeing, and Eliminating in Communication Complexity
Computational Complexity
| Hi-index | 0.00 |