How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
On the power of two-point based sampling
Journal of Complexity
Expanders that beat the eigenvalue bound: explicit construction and applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
BPP has subexponential time simulations unless EXPTIME has publishable proofs
Computational Complexity
Journal of Computer and System Sciences
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
Construction of extractors using pseudo-random generators (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Extracting all the randomness and reducing the error in Trevisan's extractors
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Pseudorandom generators without the XOR Lemma (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Hardness and hierarchy theorems for probabilistic quasi-polynomial time
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Extracting randomness: a survey and new constructions
Journal of Computer and System Sciences
Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
Extracting Randomness: How and Why - A survey
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Hard-core distributions for somewhat hard problems
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Tight bounds for depth-two superconcentrators
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Randomness vs. Time: De-Randomization under a Uniform Assumption
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Error Reduction for Extractors
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Near-Optimal Conversion of Hardness into Pseudo-Randomness
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Loss-less condensers, unbalanced expanders, and extractors
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Pseudo-random generators for all hardnesses
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Extracting all the randomness and reducing the error in Trevisan's extractors
Journal of Computer and System Sciences - STOC 1999
Derandomizing Arthur-Merlin Games under Uniform Assumptions
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Hyper-encryption against Space-Bounded Adversaries from On-Line Strong Extractors
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Error-Correcting Codes and Pseudorandom Projections
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Derandomizing polynomial identity tests means proving circuit lower bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Extractors: optimal up to constant factors
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Pseudo-random generators for all hardnesses
Journal of Computer and System Sciences - STOC 2002
Uniform hardness versus randomness tradeoffs for Arthur-Merlin games
Computational Complexity
Simple extractors for all min-entropies and a new pseudorandom generator
Journal of the ACM (JACM)
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
Derandomizing Arthur-Merlin games using hitting sets
Computational Complexity
Extractors from Reed-Muller codes
Journal of Computer and System Sciences - Special issue on FOCS 2001
Low-end uniform hardness vs. randomness tradeoffs for AM
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Pseudorandomness for Approximate Counting and Sampling
Computational Complexity
Pseudorandomness and Average-Case Complexity Via Uniform Reductions
Computational Complexity
Hardness-randomness tradeoffs for bounded depth arithmetic circuits
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
Journal of the ACM (JACM)
Deterministic extractors for independent-symbol sources
IEEE Transactions on Information Theory
Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits
SIAM Journal on Computing
Kolmogorov complexity with error
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Reconstructive dispersers and hitting set generators
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Deterministic extractors for independent-symbol sources
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Impossibility results on weakly black-box hardness amplification
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
The Journal of Supercomputing
| Hi-index | 0.06 |