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
A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
Monte-Carlo approximation algorithms for enumeration problems
Journal of Algorithms
Small-bias probability spaces: efficient constructions and applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Approximate inclusion-exclusion
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Randomness, adversaries and computation (random polynomial time)
Randomness, adversaries and computation (random polynomial time)
Parity, circuits, and the polynomial-time hierarchy
SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
Deterministic simulation of probabilistic constant depth circuits
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Simple construction of almost k-wise independent random variables
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Approximating the number of zeroes of a GF[2] polynomial
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Approximations of general independent distributions
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
An O(nlog log n) learning algorithm for DNF under the uniform distribution
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Efficient construction of a small hitting set for combinatorial rectangles in high dimension
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Deterministic Hypergraph Coloring and Its Applications
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
The good old Davis-Putnam procedure helps counting models
Journal of Artificial Intelligence Research
Frequent subgraph pattern mining on uncertain graph data
Proceedings of the 18th ACM conference on Information and knowledge management
| Hi-index | 0.00 |