Monotone circuits for matching require linear depth
Journal of the ACM (JACM)
Characterizing non-deterministic circuit size
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A characterization of span program size and improved lower bounds for monotone span programs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The Communication Complexity of the Universal Relation
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
A characterization of span program size and improved lower bounds for monotone span programs
Computational Complexity
On the constant-depth complexity of k-clique
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
On the complexity of communication complexity
Proceedings of the forty-first annual ACM symposium on Theory of computing
Ehrenfeucht-Fraïssé Games on Random Structures
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Tight bounds for monotone switching networks via fourier analysis
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Clique problem, cutting plane proofs and communication complexity
Information Processing Letters
Hi-index | 0.89 |