The design and analysis of parallel algorithms. Computational models. Complexity classes. Parallel algorithms for various problems including: basic arithmetic, sorting, searching, selection, graph theory, matrix computations, combinatorial enumeration, optimization, computational geometry, and numerical analysis. Three term hours; lectures and seminars.
Permission of the School. CISC 365 (or equivalent) is recommended.