Randomized Algorithms (Spring 2010)/Course materials: Difference between revisions

From TCS Wiki
Jump to navigation Jump to search
imported>WikiSysop
Created page with '== Course textbook == * '''[MR]''' Rajeev Motwani and Prabhakar Raghavan, ''Randomized Algorithms''. Cambridge University Press, 1995. == References and readings == * '''[CLRS]'…'
 
imported>WikiSysop
No edit summary
Line 13: Line 13:
* '''[Ch]''' Joseph Chang. ''Stochastic Processes''. Lecture notes.  
* '''[Ch]''' Joseph Chang. ''Stochastic Processes''. Lecture notes.  


* '''[HLW]''' Shlomo Hoory, Nathan Linial, and Avi Wigderson. ''Expander Graphs and Their Applications''. American Mathematical Society, 2006.
* '''[HLW]''' Shlomo Hoory, Nathan Linial, and Avi Wigderson. ''Expander Graphs and Their Applications''. American Mathematical Society, 2006. [[media:Expanders.pdf|[PDF]]]

Revision as of 08:19, 26 December 2009

Course textbook

  • [MR] Rajeev Motwani and Prabhakar Raghavan, Randomized Algorithms. Cambridge University Press, 1995.

References and readings

  • [CLRS] Thomas Cormen, Charles Leiserson, Ronald Rivest, and Clifford Stein. Introduction to Algorithms, 2nd edition. MIT Press, 2001.
  • [MU] Michael Mitzenmacher and Eli Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2005.
  • [Fe] William Feller, An Introduction to Probability Theory and Its Applications, volumes 1, 3rd edition. Wiley, 1968.
  • [AS] Noga Alon and Joel Spencer. The Probabilistic Method, 2nd edition. Wiley, 2000.
  • [Ch] Joseph Chang. Stochastic Processes. Lecture notes.
  • [HLW] Shlomo Hoory, Nathan Linial, and Avi Wigderson. Expander Graphs and Their Applications. American Mathematical Society, 2006. [PDF]