Course textbook
 |
- Rajeev Motwani and Prabhakar Raghavan.
- Randomized Algorithms.
- Cambridge University Press, 1995.
|
 |
- Michael Mitzenmacher and Eli Upfal.
- Probability and Computing: Randomized Algorithms and Probabilistic Analysis.
- Cambridge University Press, 2005.
|
References and further readings
 |
- Thomas Cormen, Charles Leiserson, Ronald Rivest, and Clifford Stein. Introduction to Algorithms, 2nd edition. MIT Press, 2001.
|
|
- William Feller, An Introduction to Probability Theory and Its Applications, volumes 1, 3rd edition. Wiley, 1968.
|
 |
- Noga Alon and Joel Spencer. The Probabilistic Method, 3nd edition. Wiley, 2008.
|
 |
- Olle Häggström, Finite Markov Chains and Algorithmic Applications. Cambridge University Press, 2002.
|
 |
- Alistair Sinclair, Markov Chain Monte Carlo: Foundations and Applications.
- Lecture Notes: http://www.cs.berkeley.edu/~sinclair/cs294/f09.html
|
|
- Shlomo Hoory, Nathan Linial, and Avi Wigderson. Expander Graphs and Their Applications. American Mathematical Society, 2006.
|
 |
- Salil Vadhan, Pseudorandomness. draft.
- http://people.seas.harvard.edu/~salil/pseudorandomness/
|
