高级算法 (Fall 2020) / Course materials: Difference between revisions

From TCS Wiki
Jump to navigation Jump to search
VisualWikitext
imported>Etone
(Created page with "= Course textbooks = {|border="2" cellspacing="4" cellpadding="3" rules="all" style="margin:1em 1em 1em 0; border:solid 1px #AAAAAA; border-collapse:collapse;empty-cells:show...")
 
Line 25: Line 25:
:Cambridge University Press, 2011.
:Cambridge University Press, 2011.
|-
|-
|[[File:CLRS.jpg‎|border|100px]]
|[[File:Algo.jpg‎|border|100px]]
|width="100%"|
|width="100%"|
:Thomas Cormen, Charles Leiserson, Ronald Rivest, and Clifford Stein.  
:Sanjoy Dasgupta, Christos Papadimitriou and Umesh Vazirani.  
:'''''Introduction to Algorithms''''', 2nd edition.  
:'''''Algorithms'''''.  
:MIT Press, 2001.
:McGraw-Hill, 2006.
|-
|-
|[[File:The_Probabilistic_Method.jpg|border|100px]]||
|[[File:The_Probabilistic_Method.jpg|border|100px]]||

Revision as of 13:50, 5 September 2022

Course textbooks

Rajeev Motwani and Prabhakar Raghavan.
Randomized Algorithms.
Cambridge University Press, 1995.
Vijay Vazirani.
Approximation Algorithms.
Springer-Verlag, 2001.

References and further readings

Michael Mitzenmacher and Eli Upfal.
Probability and Computing: Randomized Algorithms and Probabilistic Analysis.
Cambridge University Press, 2005.
David P. Williamson and David Shmoys.
The Design of Approximation Algorithms.
Cambridge University Press, 2011.
Sanjoy Dasgupta, Christos Papadimitriou and Umesh Vazirani.
Algorithms.
McGraw-Hill, 2006.
Noga Alon and Joel Spencer.
The Probabilistic Method, 4th edition.
Wiley, 2016.
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=高级算法_(Fall_2020)_/_Course_materials&oldid=10122"