Polynomial time approximation schemes for dense instances of NP-hard problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Randomness-optimal sampling, extractors, and constructive leader election
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
An O(log(n)4/3) space algorithm for (s, t) connectivity in undirected graphs
Journal of the ACM (JACM)
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
On the Derandomization of Space-Bounded Computations
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Uniform direct product theorems: simplified, optimized, and derandomized
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Randomness-Efficient Sampling within NC1
Computational Complexity
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Another motivation for reducing the randomness complexity of algorithms
Studies in complexity and cryptography
Derandomized Parallel Repetition Theorems for Free Games
Computational Complexity
| Hi-index | 0.00 |