Reading List
Completion requirements
- N. Alon and J.H. Spencer, The Probabilistic Method (third edition, Wiley, 2008).
Further Reading:
- B. Bollobás, Random Graphs (second edition, Cambridge University Press, 2001).
- M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, B. Reed, ed., Probabilistic Methods for Algorithmic Discrete Mathematics (Springer, 1998).
- S. Janson, T. Luczak and A. Rucinski, Random Graphs (John Wiley and Sons, 2000).
- M. Mitzenmacher and E. Upfal, Probability and Computing: Randomized Algorithms and Probabilistic Analysis (Cambridge University Press, New York (NY), 2005).
- M. Molloy and B. Reed, Graph Colouring and the Probabilistic Method (Springer, 2002).
- R. Motwani and P. Raghavan, Randomized Algorithms (Cambridge University Press, 1995).
Last modified: Tuesday, 14 March 2023, 7:31 PM