CS-662: Parallel Algorithms
Spring Semester 1996
Lecture Notes

This is where we keep the lecture notes for the CS-662: Parallel Algorithms course. This page will be updated as more notes become available. The dates which are displayed in bold have actual notes attached to them.

• Introduction to Parallel Algorithms
• SR - Sequential Part
• SR - Parallel Part
• Odd-Even Sort
• Speedup
• Batcher's Sort
• Scan
• Parallel Selection
• Sample Sort
• Chernoff Bounds
• Solution to Assignment 1
• Networks
• Networks part 2
• Networks part 3
• Numerical Algorithms part 1
• Numerical Algorithms part 2
• Numerical Algorithms part 3
• Numerical Algorithms part 4 FFT