Rounds in communication complexity revisited
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Communication complexity and quasi randomness
SIAM Journal on Discrete Mathematics
Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs
Journal of Computer and System Sciences
On the computational power of depth 2 circuits with threshold and modulo gates
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the degree of Boolean functions as real polynomials
Computational Complexity - Special issue on circuit complexity
Theoretical Computer Science - Special issue on complexity theory and the theory of algorithms as developed in the CIS
The space complexity of approximating the frequency moments
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Communication complexity
Quantum vs. classical communication and computation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
SIAM Journal on Computing
On data structures and asymmetric communication complexity
Journal of Computer and System Sciences
Journal of the ACM (JACM)
The BNS-chung criterion for multi-party communication complexity
Computational Complexity
Space lower bounds for distance approximation in the data stream model
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On the Distributional Complexity of Disjontness
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
The Communication Complexity of Approximate Set Packing and Covering
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Lower Bounds for Quantum Communication Complexity
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Informational Complexity and the Direct Sum Problem for Simultaneous Message Complexity
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Communication complexity as a lower bound for learning in games
ICML '04 Proceedings of the twenty-first international conference on Machine learning
An information statistics approach to data stream and communication complexity
Journal of Computer and System Sciences - Special issue on FOCS 2002
Computational complexity questions related to finite monoids and semigroups
Computational complexity questions related to finite monoids and semigroups
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Separating AC0 from depth-2 majority circuits
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Limitations of VCG-based mechanisms
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
The communication complexity of uncoupled nash equilibrium procedures
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Lower Bounds for Quantum Communication Complexity
SIAM Journal on Computing
Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity
SIAM Journal on Computing
Discrepancy and the Power of Bottom Fan-in in Depth-three Circuits
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
The pattern matrix method for lower bounds on quantum communication
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Algebrization: a new barrier in complexity theory
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
Complexity classes in communication complexity theory
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
On the power of small-depth threshold circuits
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
On the Hardness of Being Truthful
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Complexity Lower Bounds using Linear Algebra
Foundations and Trends® in Theoretical Computer Science
Multiparty Communication Complexity and Threshold Circuit Size of AC^0
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Lower Bounds in Communication Complexity
Lower Bounds in Communication Complexity
A strong direct product theorem for disjointness
Proceedings of the forty-second ACM symposium on Theory of computing
Hardness amplification in proof complexity
Proceedings of the forty-second ACM symposium on Theory of computing
Towards polynomial lower bounds for dynamic problems
Proceedings of the forty-second ACM symposium on Theory of computing
Circuits, communication and polynomials
Circuits, communication and polynomials
Distributed verification and hardness of distributed approximation
Proceedings of the forty-third annual ACM symposium on Theory of computing
An information complexity approach to extended formulations
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |