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

From TCS Wiki
Jump to navigation Jump to search
← Older edit
VisualWikitext
Zouzongrui (talk | contribs)
439 edits
Hychen (talk | contribs)
6 edits
update "references and further readings"
 
(7 intermediate revisions by 2 users not shown)
Line 15: Line 15:
= References and further readings =
= References and further readings =
{|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:Probability_and_Computing.png‎|border|100px]]||
|[[File:Probability and Computing. 2nd Edition cover.jpg|border|143x143px]]||
: Michael Mitzenmacher and Eli Upfal.  
: Michael Mitzenmacher and Eli Upfal.  
:'''''Probability and Computing: Randomized Algorithms and Probabilistic Analysis'''''.
:'''''Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis,''''' 2nd Edition
:Cambridge University Press, 2005.
:Cambridge University Press, 2017.
|-
|[[File:The_Probabilistic_Method.jpg|border|100px]]||
:Noga Alon and Joel Spencer.
:'''''The Probabilistic Method''''', 4th edition.
:Wiley, 2016.
|-
|-
|[[File:Design_of_Approximation_Algorithms.png‎|border|100px]]||
|[[File:Design_of_Approximation_Algorithms.png‎|border|100px]]||
Line 24: Line 29:
:'''''The Design of Approximation Algorithms'''''.  
:'''''The Design of Approximation Algorithms'''''.  
:Cambridge University Press, 2011.
:Cambridge University Press, 2011.
|-
|[[File:Combinatorial_Optimization.webp|border|100px]]||
:Bernhard Korte and Jens Vygen.
:'''''Combinatorial Optimization: theory and algorithms''''', 6th edition.
:Springer, 2018.
|-
|[[File:Lx=b.jpg|border|100px]]||
:Nisheeth K. Vishnoi.
:'''''Lx = b: laplacian solvers and their algorithmic applications'''''.
:Foundations and Trends® in Theoretical Computer Science, 2012.
|-
|[[File:Eigenvalues_and_Polynomials.png|border|100px]]||
:Lap Chi Lau.
:'''''Eigenvalues and Polynomials'''''.
:https://cs.uwaterloo.ca/~lapchi/cs860/notes/eigenpoly.pdf
|-
|-
|[[File:Algo.jpg‎|border|100px]]
|[[File:Algo.jpg‎|border|100px]]
Line 30: Line 50:
:'''''Algorithms'''''.  
:'''''Algorithms'''''.  
:McGraw-Hill, 2006.
:McGraw-Hill, 2006.
|-
|[[File:The_Probabilistic_Method.jpg|border|100px]]||
:Noga Alon and Joel Spencer.
:'''''The Probabilistic Method''''', 4th edition.
:Wiley, 2016.
|-
|[[File:Combinatorial_Optimization.webp|border|100px]]||
:Bernhard Korte and Jens Vygen.
:'''''Combinatorial Optimization: theory and algorithms''''', 3rd edition.
:Springer, 2008.
|-
|-
|}
|}

Latest revision as of 06:43, 14 September 2023

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: Randomization and Probabilistic Techniques in Algorithms and Data Analysis, 2nd Edition
Cambridge University Press, 2017.
Noga Alon and Joel Spencer.
The Probabilistic Method, 4th edition.
Wiley, 2016.
David P. Williamson and David Shmoys.
The Design of Approximation Algorithms.
Cambridge University Press, 2011.
Bernhard Korte and Jens Vygen.
Combinatorial Optimization: theory and algorithms, 6th edition.
Springer, 2018.
Nisheeth K. Vishnoi.
Lx = b: laplacian solvers and their algorithmic applications.
Foundations and Trends® in Theoretical Computer Science, 2012.
Lap Chi Lau.
Eigenvalues and Polynomials.
https://cs.uwaterloo.ca/~lapchi/cs860/notes/eigenpoly.pdf
Sanjoy Dasgupta, Christos Papadimitriou and Umesh Vazirani.
Algorithms.
McGraw-Hill, 2006.
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=高级算法_(Fall_2023)_/_Course_materials&oldid=11641"