COSC 45 - Design and Analysis of Algorithms (Dartmouth College S97)

Text: Introduction to Algorithms, by Thomas Cormen, Charles Leiserson, and Ron Rivest, published by McGraw Hill and MIT Press. (Click here for errata.)

Instructor: Neal Young. Office: 218 Sudikoff. Phone: 646-1710. Email: ney@cs.dartmouth.edu.

Meeting time: MWF 10-11:05pm in 212 Sudikoff.

On-line course handouts: here.

Summary of lectures

links: (I've downloaded some of the software, talk to me if interested)

• intro discrete math course at Berkeley
• Algorithms courses on the net.
• lecture notes and problem sets via my old cosc-109 algorithms home page.
• algorithms in the "real world" (course at CMU)
• advanced algorithms course notes from Michel Goemans at MIT
• Linear programming FAQ
• DIMACS - center for discrete math and theoretical CS. Check out their implementation challenges.
• LEDA - library of efficient data structures and algorithms (Max Planck Institute)
• software visualization - Goergia Tech.
• geomview - geometry viewing program from U. Minnesota
• optimization codes in the public domain