Department of Computer Science Theory of Computer Algorithms (Winter 2008) 4005-800-01 (Calendar Description)

Home --- Syllabus --- Slides --- Assignments --- Resources

Instructor: Richard Zanibbi, Office hours: Tues 2-4pm, Thursday 10am-12pm (or by appointment), 70-3551 (Golisano College)
Lectures (NOTE: two locations):
Mondays 12-1:50pm (70-2590, Golisano College)
Wednesdays 12-1:50pm (70-3435, Golisano College)

Resources

Theory Tutoring Center

The schedule for theory tutoring in the CS tutoring center (70-3660) is available here.

Required Course Textbook

• Kleinberg, Jon and Tardos, Éva. Algorithm Design. Addison-Wesley, 2005. Text Web Page

Additional Sources

• T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein. Introduction to Algorithms, 2nd edition. Available online through RIT libraries here.
  • MIT Open Courseware resources for the Cormen et al. text (course taught by Leiserson) are available here.
  • If you search on 'algorithms' from the same web site, you will find a number of other books on algorithms available online through the library.
• T.H. Cormen, C.E. Leiserson, R.L. Rivest. Introduction to Algorithms, first edition. MIT Press, 1990. (available in Watson library, to be placed on 2hr reserve).
• S.S. Skiena. The Algorithm Design Manual. TELOS, 1998 (available in Watson library, to be placed on 2hr reserve)
• D.E. Knuth. The Art of Computer Programming, Volumes 1-3, Addison-Wesley, 1981 (available in Watson library).
• D.J. Velleman. How to Prove it: A Structured Approach. Cambridge University Press, 1994 (available in Watson library - also available for a small cost from Amazon, etc.)