1. M. Agrawal, N. Kayal, and N. Saxena, "PRIMES is in P", 2002. 2. Blum, Karp, Vornberger, Papadimitriou, Yannakakis, "The complexity of testing whether a graph is a superconcentrator", Information Processing Letters, 13, 164--167, 1981. 3. O. Reingold, S. Vadhan, and A. Wigderson, "Entropy waves, the zig-zag graph product, and new constant-degree expanders", Annals of Mathematics, 155(1):157--187, 2002. (chosen by Leila) 4. M. Capalbo, O. Reingold, S. Vadhan, and A. Wigderson, "Randomness conductors and constant-degree lossless expanders", STOC 2002. 5. N. Nisan and A. Wigderson, "Hardness vs. Randomness", Journal of Computer and System Science, 49, 149--167, 1994. (chosen by Habil) 6. L. Babai, L. Fortnow, N. Nisan and A. Wigderson, "BPP has subexponential time simulations unless EXPTIME has publishable proofs", Computational Complexity, 3, 307--318, 1993. 7. M. Sudan, L. Trevisan, and S. Vadhan, "Pseudorandom generators without the XOR lemma", Journal of Computer and System Science, 62(2), 236--266, 2001. 8. R. Impagliazzo and A. Wigderson, "P=BPP if E requires exponential circuits: Derandomizing the XOR Lemma", STOC 1997. 9. L. Trevisan, "Extractors and pseudorandom generators", Journal of ACM, 48(4), 860--879, 2001. 10. A. Ta-Shma, D. Zuckerman, and S. Safra, "Extractors from Reed-Muller codes, FOCS 2001. 11. M. Sudan, "Decoding of Reed Solomon codes beyond the error-correction bound", Journal of Complexity, 13(1), 180--193, 1997. (chosen by Reza) 12. N. Alon, O. Goldreich, J. Hastad, and R. Peralta, "Simple Constructions of Almost k-wise Independent Random Variables", Random Structures and Algorithms, 3(3), 289--304, 1992. (chosen by Arash) 13. N. Nisan, "Pseudorandom generators for space-bounded computation", Combinatorica, 12(4), 449--461, 1992. (chosen by Ladan) 14. N. Nisan and D. Zuckerman, "Randomness is linear in space", Journal of Computer and System Science, 52(1), 43-52, 1996. 15. R. Impagliazzo and D. Zuckerman, "How to recycle random bits", FOCS 1989. (chosen by Peter)