Deterministic simulation in LOGSPACE
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Unbiased bits from sources of weak randomness and probabilistic communication complexity
SIAM Journal on Computing - Special issue on cryptography
On the power of two-point based sampling
Journal of Complexity
Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Pseudorandom generators for space-bounded computations
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Simulating (logcn)-wise independence in NC
Journal of the ACM (JACM)
Simulating BPP using a general weak random source
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Expanders that beat the eigenvalue bound: explicit construction and applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The probabilistic method yields deterministic parallel algorithms
Proceedings of the 30th IEEE symposium on Foundations of computer science
Chernoff-Hoeffding bounds for applications with limited independence
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Expanders that beat the eigenvalue bound: explicit construction and applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Pseudorandomness for network algorithms
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
Explicit dispersers with polylog degree
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On extracting randomness from weak random sources (extended abstract)
STOC '96 Proceedings of the twenty-eighth 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 '98 Proceedings of the thirtieth 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
Extractors and pseudorandom generators
Journal of the ACM (JACM)
A High Girth Graph Construction and a Lower Bound for Hitting Set Size for Combinatorial Rectangles
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
On the Derandomization of Space-Bounded Computations
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Extractors for a constant number of polynomially small min-entropy independent sources
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Pairwise independence and derandomization
Foundations and Trends® in Theoretical Computer Science
On cryptography with auxiliary input
Proceedings of the forty-first annual ACM symposium on Theory of computing
Extractors Using Hardness Amplification
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Memory Leakage-Resilient Encryption Based on Physically Unclonable Functions
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Randomness extraction via δ-biased masking in the presence of a quantum attacker
TCC'08 Proceedings of the 5th conference on Theory of cryptography
On the error parameter of dispersers
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
Perfectly secure password protocols in the bounded retrieval model
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Hi-index | 0.00 |