[1] Noam Nisan and Avi Wigderson. Hardness vs randomness. Journal of Computer and
System Sciences, 49(2):149-167, October 1994.

[2] Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge
University Press, Cambridge, 1995. Chap. 5.
 
[3] M. Sitharam. Generalized Boolean hierarchies. University of Wisconsin Ph.D
thesis and TR Aug. 1990. (for problems in BPP that have not been derandomized)
http://www.cise.ufl.edu/~sitharam/BOOL/thesis.pdf

[4] Luca Trevisan. Extractors and pseudorandom generators. Journal of ACM, 48(4),
pages 860-879, 2001.
 
[5] Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan.
Weak Random Sources, Hitting Sets, and BPP Simulations. SIAM Journal on Computing
Volume 28, Number 6.

[6] N. Nisan. Extracting randomness: How and why. Proceedings of the 11th IEEE
Conference on Computational Complexity, pages 44--58, 1996.

[7] D. Sivakumar. Algorithmic Derandomization via Complexity Theory. Proc. 34th
Annual ACM Symposium on Theory of Computing and Proc. 17th Annual IEEE Conference
on Computational Complexity, 2002.

[8] M. Sitharam, T. Straney. Derandomized learning, testing and fooling of
Boolean functions over finite abelian groups. International Journal of Foundations
of CS. Vol 12, No. 4 ,491-516, 2001.
http://www.cise.ufl.edu/~sitharam/CIRCUIT/TIM/IJFCS/jan27paper2.pdf

[9] M. Sitharam, T. Straney. Derandomized learning of Boolean functions.  
Proceedings of Algorithmic Learning Theory 1997, Lecture notes in
Artificial Intelligence, subseries of Lecture Notes in Computer Science, 1316,
Ming Li and Akira Maruoka Ed.s, Springer-Verlag, 1997, pp. 100-115. 
http://www.cise.ufl.edu/~sitharam/CIRCUIT/TIM/altfinal.pdf
 
[10] M. Sitharam. Pseudorandom generators and learning algorithms for AC^0.
Computational Complexity (5), 1995, 248-266. Appeared in
proceedings of ACM Symposium on the Theory of Computing, 1994. 
http://www.cise.ufl.edu/~sitharam/CIRCUIT/PAPER1/newpaper1.pdf

[11] M. Sitharam. Approximation from spaces of functions over the cube,
complexity lower bounds, derandomization, and learning algorithms. Kent State TR
May 96. Appears in Electronic Colloquium on Computational Complexity, 96.
http://www.cise.ufl.edu/~sitharam/CIRCUIT/PAPER3/linapprox.pdf