Randomized Algorithms (Spring 2010)/Course materials

From TCS Wiki
Revision as of 08:33, 11 January 2010 by imported>WikiSysop (→‎References and further readings)
Jump to navigation Jump to search

Course textbook

  • [MR] Rajeev Motwani and Prabhakar Raghavan, Randomized Algorithms. Cambridge University Press, 1995.
《随机算法》已被高等教育出版社翻译引进。

References and further 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.
《概率与计算》,机械工业出版社翻译引进。与[MR]相比,该书内容覆盖面较小,着重于分配问题 (allocation problems, balls-into-bins model),但结构更加清晰。
  • [Feller] 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.
组合数学的概率方法。
耶鲁大学随机过程课程讲义。
  • [HLW] Shlomo Hoory, Nathan Linial, and Avi Wigderson. Expander Graphs and Their Applications. American Mathematical Society, 2006. [PDF]
原为普林斯顿高等研究院和以色列希伯来大学的课程讲义,是目前扩展图理论最好的介绍。