CS646A - Parallel Algorithms
Prerequisites:
3-0-0-9
Course Contents
Complexity measure for parallel algorithms. Parallel combinatorial algorithms: permutations with and without repetitions, combinations, derangements. Parallel searching algorithms: maximum/minimum, median, Kth largest/smallest element. Parallel sorting algorithms. Parallel graph algorithms: parallel graph search and tree traversal algorithms, parallel algorithms for connectivity problems, parallel algorithms for path problems.
Topics
Current Course Information
Instructor(s):
Number of sections:
Tutors for each section:
Schedule for Lectures:
Schedule for Tutorial:
Schedule for Labs: