CMPSCI 311: Theory of Algorithms

David Mix Barrington

Fall, 2006

This is the home page for CMPSCI 311. CMPSCI 311 is the undergraduate core course in the theory of algorithms and will deal with methods of analysis, four major algorithmic paradigms, NP-completeness, and ways to deal with NP-hard problems.

The required textbook is Algorithm Design by Jon Kleinberg and Eva Tardos (Addison Wesley, first edition 2006, ISBN 0-321-29535-8). I have ordered copies at the Jeffrey Amherst College Store in downtown Amherst (26 S. Prospect Street, accessible from the Common through the alley between Hastings and La Veracruzana). The book is also available through online retailers. This is the first time this book has been used at UMass -- the other texts by Cormen-Leiserson-Rivest-Stein and Levitin may be of use as references but they are not the text for the course. You will need a copy of Kleinberg-Tardos as I will be lecturing out of it fairly closely and the homework assignments will mostly come from there.

Important Course Material (as it becomes available):

Announcements (15 January):

Last modified 15 January 2007