随机算法 (Fall 2011)/Course materials: Difference between revisions
Jump to navigation
Jump to search
(Created page with '= Course textbook = {|border="2" cellspacing="4" cellpadding="3" rules="all" style="margin:1em 1em 1em 0; border:solid 1px #AAAAAA; border-collapse:collapse;empty-cells:show;" |…') |
imported>WikiSysop No edit summary |
||
| Line 2: | Line 2: | ||
{|border="2" cellspacing="4" cellpadding="3" rules="all" style="margin:1em 1em 1em 0; border:solid 1px #AAAAAA; border-collapse:collapse;empty-cells:show;" | {|border="2" cellspacing="4" cellpadding="3" rules="all" style="margin:1em 1em 1em 0; border:solid 1px #AAAAAA; border-collapse:collapse;empty-cells:show;" | ||
|[[File:MR-randomized-algorithms.png|border|100px]]|| | |[[File:MR-randomized-algorithms.png|border|100px]]|| | ||
Rajeev Motwani and Prabhakar Raghavan, '''''Randomized Algorithms'''''. Cambridge University Press, 1995. | *Rajeev Motwani and Prabhakar Raghavan, '''''Randomized Algorithms'''''. Cambridge University Press, 1995. | ||
|- | |- | ||
|[[File: | |[[File:Probability_and_Computing.png|border|100px]]|| | ||
* Michael Mitzenmacher and Eli Upfal. '''''Probability and Computing: Randomized Algorithms and Probabilistic Analysis'''''. Cambridge University Press, 2005. | * Michael Mitzenmacher and Eli Upfal. '''''Probability and Computing: Randomized Algorithms and Probabilistic Analysis'''''. Cambridge University Press, 2005. | ||
|} | |} | ||
= References and further readings = | = References and further readings = | ||
* 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. | ||
* 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. | ||
* Noga Alon and Joel Spencer. ''The Probabilistic Method'', 3nd edition. Wiley, 2008. | * 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. | * Olle Häggström, '''''Finite Markov Chains and Algorithmic Applications.''''' Cambridge University Press, 2002. | ||
* Alistair Sinclair, | * 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'' | * Shlomo Hoory, Nathan Linial, and Avi Wigderson. '''''Expander Graphs and Their Applications.''''' American Mathematical Society, 2006. | ||
* Salil Vadhan, | * Salil Vadhan, '''Pseudorandomness.''' draft. http://people.seas.harvard.edu/~salil/pseudorandomness/ | ||
Revision as of 03:51, 21 July 2011
Course textbook
 |
|
 |
|
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/