Lectures on the complexity of bilinear problems
Lectures on the complexity of bilinear problems
Rounds in communication complexity revisited
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Why is Boolean complexity theory difficult?
Poceedings of the London Mathematical Society symposium on Boolean function complexity
Superconcentrators, generalizers and generalized connectors with limited depth
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
The algorithmic aspects of uncrowded hypergraphs
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Sparse 0-1-matrices and forbidden hypergraphs
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Reducing the Servers Computation in Private Information Retrieval: PIR with Preprocessing
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Communication in the presence of replication
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Complexity Lower Bounds using Linear Algebra
Foundations and Trends® in Theoretical Computer Science
Hi-index | 0.00 |