NCSC-8021  Parallel and Randomized Algorithms

Note: The following provides a suggested course description, objectives, and an outline. These may be modified pending discussion with the Faculty Chairs, proposing faculty, and other curriculum reviewers.

Course Description: This course covers material on algorithms for parallel computation, data structures, graph algorithms, geometric algorithms, approximate counting, random walks, number-theoretic algorithms, derandomization techniques, and probabilistic analysis of algorithms.