History/Overview/Survey Articles

• N. Alon, Problems and results in extremal combinatorics, I, Discrete Math., in press.
• N. Alon, Algebraic and probabilistic methods in Discrete Mathematics, in: "Visions in Mathematics, Towards 2000", (N. Alon et. al. eds.), Birkhäuser, 2000, pp. 455-470.
• N. Alon, Spectral techniques in graph algorithms, Lecture Notes in Computer Science 1380 (C. L. Lucchesi and A. V. Moura, Eds.), Sringer, Berlin, 1998, 206-215.
• N. Alon, Randomness and pseudo-randomness in Discrete Mathematics, Proc. of the 2 European Congress of Mathematics, Progress in Mathematics 168 (1998), 1-14.
• Noam Nisan and Amnon Ta-Shma. Extracting Randomness: A Survey and New Constructions. JCSS 1999
• Amnon Ta-Shma's Dissertation, Refining Randomness Hebrew University 1996
• Peter G. Doyle and J. Laurie Snell Random Walks and Electric Networks. A probably more up-to-date version is here

Some free books

• http://omega.math.albany.edu:8008/JaynesBook.html
• http://web.mit.edu/afs/athena.mit.edu/user/d/i/dimitrib/www/Probability.html
• http://br.crashed.net/~akrowne/

Similar/Related Courses

• Algorithm Courses on the WWW
• Machine Learning Theory (CMU, A. Blum,  Spring 2008)
• Statistical Learning Theory and Applications (MIT, Tomaso Poggio, Ryan Rifkin, Jake Bouvrie and Lorenzo Rosasco,  Spring 2008)
• Theoretical Machine Learning (Princeton, Bob Schapire, Spring 2008)
• Randomized Algorithms (Berkeley, Luca Trevisan, Spring 2003)
• Randomized Algorithms (MIT, David Karger, Spring 2007)
• Randomized Algorithms (GATech, Juan Vera, Spring 2007)
• Approximation Algorithms (CMU, Anupam Gupta and R. Ravi, Fall 2005)
• Randomized Algorithms (UMD, Aravind Srinivatsan, Spring 2003)
• Randomized Algorithms and Probabilistic Techniques in CS (Purdue, Gopal Pandurangan, Fall 2005)