Prerequisites: CS 218; or equivalent; graduate standing
Description: Covers advanced techniques for the design and analysis of algorithms and data structures. Topics include linear and integer programming, randomized algorithms, approximation algorithms, online algorithms, parallel algorithms, and distributed algorithms. Emphasizes formal proofs of correctness and rigorous performance analysis.
Credit: May be taken Satisfactory (S) or No Credit (NC) with consent of instructor and graduate advisor.