Read our cookies policy and privacy statement for more information.
×Denver, Colorado•
Advanced design and analysis techniques: dynamic programming, greedy algorithms, amortized analysis. Advanced data structures: Fibonacci heaps, union-find data structures. Study of variety of special topics, which may include: graph algorithms, optimization problems, Fast Fourier Transform, string matching, geometric algorithms, NP-completeness and approximation algorithms
Units: 3.0
Hours: 3 to 3