Author:
Raz Ran,Reingold Omer,Vadhan Salil
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference52 articles.
1. Almost sorting in one round;Ajtai,1989
2. The Probabilistic Method;Alon,2000
3. A. E. Andreev, A. E. F. Clementi, and J. D. P. Rolim, Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs, in Automata, Languages and Programming, 24th International Colloquium, Bologna, Italy, 7–11 July 1997 (P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, Eds.), Lecture Notes in Computer Science, Vol. 1256, pp. 177–187, Springer-Verlag, Berlin/New York.
4. Free bits, PCPs, and nonapproximability—towards tight results;Bellare;SIAM J. Comput,1998
5. Unbiased bits from sources of weak randomness and probabilistic communication complexity;Chor;SIAM J. Comput,1988
Cited by
78 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献