Presented-by

15-451: Algorithm Design and Analysis

Department:
Computer Science
Units:
12.0
Related:
http://www.csd.cs.cmu.edu

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.

Add to schedule

Lec TR 12:00 pm - 01:20 pm WEH 7500 Blum
A W 11:30 am - 12:20 pm DH 1217 Instructor TBA
B W 02:30 pm - 03:20 pm WEH 6423 Instructor TBA
C W 03:30 pm - 04:20 pm WEH 5302 Instructor TBA

Add to schedule