Separating the polynomial-time hierarchy by oracles
Proc. 26th annual symposium on Foundations of computer science
A fast and simple randomized parallel algorithm for the maximal independent set problem
Journal of Algorithms
Almost optimal lower bounds for small depth circuits
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The monotone circuit complexity of Boolean functions
Combinatorica
On the method of approximations
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The complexity of finite functions
Handbook of theoretical computer science (vol. A)
Approximations of general independent distributions
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Symmetric approximation arguments for monotone lower bounds without sunflowers
Computational Complexity
A Note on the Bottleneck Counting Argument
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Finite Limits and Monotone Computations: The Lower Bounds Criterion
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Counting bottlenecks to show monotone P ? NP
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Potential of the approximation method
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Reductions for monotone Boolean circuits
Theoretical Computer Science
Linear-size log-depth negation-limited inverter for k-tonic binary sequences
Theoretical Computer Science
General Pseudo-random Generators from Weaker Models of Computation
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Linear-size log-depth negation-limited inverter for k-tonic binary sequences
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
On the negation-limited circuit complexity of sorting and inverting k-tonic sequences
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Reductions for monotone boolean circuits
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
On the monotone circuit complexity of quadratic boolean functions
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Negation-Limited complexity of parity and inverters
ISAAC'06 Proceedings of the 17th international conference on Algorithms 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
| Hi-index | 0.00 |