Teaching

CMU 15-451 (Algorithms), Spring 2009

TAs: David Abraham, Pranjal Awasthi, Maxim Makatchev, Daniel Nuffer

General info

• Lectures: Tue/Thu 12-1:20, Wean 7500.
• Recitations: 

  A	W	11:30AM	12:20PM	DH 1217	Instructor Daniel Nuffer
  B	W	02:30PM	03:20PM	WEH 6423	Instructor Pranjal Awasthi
  C	W	03:30PM	04:20PM	WEH 5302	Instructor David Abraham
  D	W	01:30PM	02:20PM	WEH 5312	Instructor Maxim Makatchev

• Course information
• Schedule
• The course bboards are: academic.cs.15-451 (for announcements) and academic.cs.15-451.discuss (for general discussion).

This course is about the design and analysis of algorithms. We study specific algorithms for a variety of problems, as well as general design and analysis techniques. Specific topics include searching, sorting, algorithms for graph problems, efficient data structures, lower bounds and NP-completeness. A variety of other topics may be covered at the discretion of the instructor. These include parallel algorithms, randomized algorithms, geometric algorithms, low level techniques for efficient programming, cryptography, and cryptographic protocols.