Separating the polynomial-time hierarchy by oracles
Proc. 26th annual symposium on Foundations of computer science
Almost optimal lower bounds for small depth circuits
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Limits on the power of concurrent-write parallel machines
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The monotone circuit complexity of Boolean functions
Combinatorica
The Complexity of Computing
An Exponential Lower Bound for One-Time-Only Branching Programs
Proceedings of the Mathematical Foundations of Computer Science 1984
A Lower Bound on Complexity of Branching Programs (Extended Abstract)
Proceedings of the Mathematical Foundations of Computer Science 1984
Bounds for width two branching programs
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
The Complexity of Equivalence and Containment for Free Single Variable Program Schemes
The Complexity of Equivalence and Containment for Free Single Variable Program Schemes
Bounded Width Polynominal Size Branching Programs Recognize Exactly Those
Bounded Width Polynominal Size Branching Programs Recognize Exactly Those
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
On the complexity of branching programs and decision trees for clique functions
Journal of the ACM (JACM)
Towards optimal simulations of formulas by bounded-width programs
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
On the Expressive Power of OKFDDs
Formal Methods in System Design
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On Multipartition Communication Complexity
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Almost k-wise independence and hard Boolean functions
Theoretical Computer Science - Latin American theoretical informatics
Triangle-Freeness is Hard to Detect
Combinatorics, Probability and Computing
On multi-partition communication complexity
Information and Computation
An impossibility gap between width-4 and width-5 permutation branching programs
Information Processing Letters
On multi-partition communication complexity
Information and Computation
An impossibility gap between width-4 and width-5 permutation branching programs
Information Processing Letters
Finding compact BDDs using genetic programming
EuroGP'06 Proceedings of the 2006 international conference on Applications of Evolutionary Computing
Generalized strong extractors and deterministic privacy amplification
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
Tight bounds for monotone switching networks via fourier analysis
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |