随机算法 (Fall 2011)/Course materials: Difference between revisions

From TCS Wiki
Jump to navigation Jump to search
imported>WikiSysop
No edit summary
imported>WikiSysop
No edit summary
Line 17: Line 17:
* Thomas Cormen, Charles Leiserson, Ronald Rivest, and Clifford Stein. '''''Introduction to Algorithms''''', 2nd edition. MIT Press, 2001.
* Thomas Cormen, Charles Leiserson, Ronald Rivest, and Clifford Stein. '''''Introduction to Algorithms''''', 2nd edition. MIT Press, 2001.
|-
|-
|[[File:Probability_and_Computing.png‎|border|100px]]||
|[[File:Feller.JPG‎|border|100px]]||
* William Feller, '''''An Introduction to Probability Theory and Its Applications''''', volumes 1, 3rd edition. Wiley, 1968.
* William Feller, '''''An Introduction to Probability Theory and Its Applications''''', volumes 1, 3rd edition. Wiley, 1968.
|-
|-
Line 30: Line 30:
:Lecture Notes: http://www.cs.berkeley.edu/~sinclair/cs294/f09.html
:Lecture Notes: http://www.cs.berkeley.edu/~sinclair/cs294/f09.html
|-
|-
|[[File:Probability_and_Computing.png‎|border|100px]]||
|[[File:WL-expander.png‎|border|100px]]||
* Shlomo Hoory, Nathan Linial, and Avi Wigderson. '''''Expander Graphs and Their Applications.''''' American Mathematical Society, 2006.  
* Shlomo Hoory, Nathan Linial, and Avi Wigderson. '''''Expander Graphs and Their Applications.''''' American Mathematical Society, 2006.  
|-
|-

Revision as of 04:17, 21 July 2011

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/