Electrical & Computer Engin 665 - Algorithms
Spring
2014
01
3.00
Maciej Ciesielski
TU TH 11:15AM 12:30PM
UMass Amherst
55227
Introduction to the design and analysis of algorithms. Topics include basic algorithmic paradigms (e.g. divide-and-conquer, dynamic programming, the greedy approach and randomization), their application to core problems in graph theory and optimization, as well as analysis of time and space complexity.
Open to Graduate students only.