A time-randomness tradeoff for oblivious routing
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On the existence of pseudorandom generators
CRYPTO '88 Proceedings on Advances in cryptology
A randomized parallel algorithm for planar graph isomorphism
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Small-bias probability spaces: efficient constructions and applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Rigorous time/space tradeoffs for inverting functions
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Perfect local randomness in pseudo-random sequences
CRYPTO '89 Proceedings on Advances in cryptology
How to predict congruential generators
CRYPTO '89 Proceedings on Advances in cryptology
Approximations of general independent distributions
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
More deterministic simulation in logspace
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
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
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Randomized algorithms and pseudorandom numbers
Journal of the ACM (JACM)
Derandomization through approximation: an NC algorithm for minimum cuts
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The amazing power of pairwise independence (abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Impossibility results for recycling random bits in two-prover proof systems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Interactive proofs and the hardness of approximating cliques
Journal of the ACM (JACM)
Randomness-optimal sampling, extractors, and constructive leader election
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On the construction of pseudo-random permutations: Luby-Rackoff revisited (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
P = BPP if E requires exponential circuits: derandomizing the XOR lemma
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Probabilistic checking of proofs: a new characterization of NP
Journal of the ACM (JACM)
Pseudorandom generators without the XOR Lemma (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Extractors and pseudo-random generators with optimal seed length
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
A combinatorial error bound for t-point-based sampling
Theoretical Computer Science
Pairwise independence and derandomization
Foundations and Trends® in Theoretical Computer Science
The unified theory of pseudorandomness: guest column
ACM SIGACT News
Improved Separations between Nondeterministic and Randomized Multiparty Communication
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Finding duplicates in a data stream
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Improved Separations between Nondeterministic and Randomized Multiparty Communication
ACM Transactions on Computation Theory (TOCT)
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
A simplified and generalized treatment of Luby-Rackoff pseudorandom permutation generators
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Testing non-uniform k-wise independent distributions over product spaces
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Quasi-random rumor spreading: Reducing randomness can be costly
Information Processing Letters
On the Implementation of Huge Random Objects
SIAM Journal on Computing
On parallel composition of zero-knowledge proofs with black-box quantum simulators
Quantum Information & Computation
Studies in complexity and cryptography
A sample of samplers: a computational perspective on sampling
Studies in complexity and cryptography
Bounded Independence Fools Halfspaces
SIAM Journal on Computing
The Complexity of Distributions
SIAM Journal on Computing
On the Composition of Public-Coin Zero-Knowledge Protocols
SIAM Journal on Computing
| Hi-index | 0.00 |