Textbook

Our required textbook (from which we will have assigned readings!) is:

• John Kleinberg and Éva Tardos, Algorithm Design, Addison-Wesley Publishing company, 2005, ISBN 0-321-29535-8.

We have been informed by previous students (but cannot confirm or deny) that the international edition of the textbook is cheaper and yet corresponds closely to the edition listed here.

You may find Kevin Wayne’s slides accompanying the book a good supplement: http://www.cs.princeton.edu/~wayne/kleinberg-tardos/

(You could even use them for your pre-class readings as long as you’re aware that they’re not the same as the textbook. “Buyer beware.”)

Other references

• Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, Introduction to Algorithms, 3rd edition, MIT Press, 2009, ISBN 0-262-03384-4.
• Sanjoy Dasgupta, Christos Papadimitriou and Umesh Vazirani, Algorithms, McGraw Hill Book Company, 2008, ISBN 0-07-352340-2.
• Michael Garey and David Johnson, Computers and Intractability: a Guide to the theory of NP-Completeness, W.H. Freeman & Company, 1979, ISBN 0-7167-1044-5.
• Donald E. Knuth, The Art of Computer Programming, Volume 1-4a.

Online references:

• Algorithms, etc. by Jeff Erickson. A good, up-to-date review of algorithms.
• The Algorithm Design Manual by Steven S. Skiana. A somewhat out-of-date, but engagingly written review of algorithms. (Also a print book now in 2nd edition.)
• Algorithms on WikiBooks. (Open.. but spotty and strange in coverage. Maybe you can help!)

CS Reading Room

The CS Reading Room has most of our references on reserve so that you can browse them in the room (but not checkout). You can find the Reading Room on the second floor of the older wing of ICCS, next to its central atrium.