COS 730 - Parallel Algorithms

3 hrs.

Prerequisite(s): Knowledge of sequential algorithm design and analysis, NP-completeness, proficiency in high-level language programming, including pointer manipulation. Topics include models of parallel computation, general techniques, graph algorithms, expression evaluation, parallel sorting, parallel string matching, and P-completeness.