Pseudorandom generators without the XOR Lemma (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On the hardness of approximating the permanent of structured matrices
Computational Complexity
Using nondeterminism to amplify hardness
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Limit theorems for random permanents with exchangeable structure
Journal of Multivariate Analysis
Special Issue On Worst-case Versus Average-case Complexity Editors' Foreword
Computational Complexity
Hardness amplification proofs require majority
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Hardness Amplification Proofs Require Majority
SIAM Journal on Computing
Adaptive submodularity: theory and applications in active learning and stochastic optimization
Journal of Artificial Intelligence Research
Hi-index | 0.00 |