More deterministic simulation in logspace
STOC '93 Proceedings of the twenty-fifth 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
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
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
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
Randomness in private computations
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Randomness vs. fault-tolerance
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Probabilistic checking of proofs: a new characterization of NP
Journal of the ACM (JACM)
Explicit OR-dispersers with polylogarithmic degree
Journal of the ACM (JACM)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Amortizing randomness in private multiparty computations
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Secret sharing and visual cryptography schemes
Sec '01 Proceedings of the 16th international conference on Information security: Trusted information: the new decade challenge
Randomness in Visual Cryptography
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
A Randomnesss-Rounds Tradeoff in Private Computation
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Randomness in secret sharing and visual cryptography schemes
Theoretical Computer Science
Can every randomized algorithm be derandomized?
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Smooth entropy and Rényi entropy
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Computational complexity since 1980
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Generalized strong extractors and deterministic privacy amplification
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
| Hi-index | 0.00 |
It is shown how to simulate BPP and approximation algorithms in polynomial time using the output from a delta -source. A delta -source is a weak random source that is asked only once for R bits, and must output an R-bit string according to some distribution that places probability no more than 2/sup - delta R/ on any particular string. Also given are two applications: one to show the difficulty of approximating the size of the maximum clique, and the other to the problem of implicit O(1) probe search.