# Parallel Algorithms

- Institution: IIT Guwahati
- Department: Computer Science and Engineering
- Teacher: Prof. Sajith Gopalan
- Level: Undergraduate
- Language: English
- Subjects: Computer science, Engineering
- Source: [NPTEL](https://nptel.ac.in/courses/106103188)
- Licence: [CC BY-NC-SA](https://nptel.ac.in/faq) (Non-commercial use only.)
- Syllabus: [at the source](https://nptel.ac.in/courses/106103188)
- Who can watch: Tweens profiles and older (sources give no ratings; placed by Invisible Network from the source's own words)

## Lectures

1. [Shared Memory Models - 1](https://invisiblenetwork.ai/learn/nptel/106103188/e84d415c8ed3) (Video)
2. [Shared Memory Models - 2](https://invisiblenetwork.ai/learn/nptel/106103188/238e90368165) (Video)
3. [Interconnection Networks](https://invisiblenetwork.ai/learn/nptel/106103188/0c03ffe18f8a) (Video)
4. [Cost and Optimality](https://invisiblenetwork.ai/learn/nptel/106103188/a4e744226bca) (Video)
5. [Basic Techniques 1](https://invisiblenetwork.ai/learn/nptel/106103188/708ce144ca59) (Video)
6. [Basic Techniques 2](https://invisiblenetwork.ai/learn/nptel/106103188/ef535a1dbab9) (Video)
7. [Basic Techniques 3](https://invisiblenetwork.ai/learn/nptel/106103188/188b3df6b5f0) (Video)
8. [Basic Techniques 4](https://invisiblenetwork.ai/learn/nptel/106103188/d6120cffd955) (Video)
9. [Basic Techniques 5](https://invisiblenetwork.ai/learn/nptel/106103188/7b1bf2124036) (Video)
10. [Odd Even Merge Sort (OEMS)](https://invisiblenetwork.ai/learn/nptel/106103188/56cfb1acf9b8) (Video)
11. [OEMS, Bitonic-Sort-Merge Sort (BSMS)](https://invisiblenetwork.ai/learn/nptel/106103188/0fc32634f392) (Video)
12. [BSMS, Optimal List Colouring](https://invisiblenetwork.ai/learn/nptel/106103188/1d1290f96a11) (Video)
13. [Description](https://invisiblenetwork.ai/learn/nptel/106103188/9c3851fe6866) (Video)
14. [Analysis](https://invisiblenetwork.ai/learn/nptel/106103188/f9c68cb0b999) (Video)
15. [Applications](https://invisiblenetwork.ai/learn/nptel/106103188/5a8fe492cb9d) (Video)
16. [Applications](https://invisiblenetwork.ai/learn/nptel/106103188/cfa1b16fabe9) (Video)
17. [Fast optimal merge algorithm](https://invisiblenetwork.ai/learn/nptel/106103188/f8e457e49ebc) (Video)
18. [High level Description](https://invisiblenetwork.ai/learn/nptel/106103188/91af65e5fb48) (Video)
19. [Cole's Merge Sort: Details](https://invisiblenetwork.ai/learn/nptel/106103188/dab3007bd4f7) (Video)
20. [Analysis of Cole's Merge Sort; Lower bound for sorting](https://invisiblenetwork.ai/learn/nptel/106103188/2edcb492c47a) (Video)
21. [Sorting Lower bound; Connected Components](https://invisiblenetwork.ai/learn/nptel/106103188/b0fb6c84af8d) (Video)
22. [Connected Components (CREW)](https://invisiblenetwork.ai/learn/nptel/106103188/935d6ee3d6f2) (Video)
23. [Connected Components, Vertex Colouring](https://invisiblenetwork.ai/learn/nptel/106103188/79a427f11e6d) (Video)
24. [Sorting on a 2D mesh](https://invisiblenetwork.ai/learn/nptel/106103188/f41dd0d61410) (Video)
25. [Sorting on a 2D mesh](https://invisiblenetwork.ai/learn/nptel/106103188/f6e172c5a341) (Video)
26. [Sorting, Offline routing on a 2D mesh](https://invisiblenetwork.ai/learn/nptel/106103188/10b822a66214) (Video)
27. [Sorting on a 3D mesh](https://invisiblenetwork.ai/learn/nptel/106103188/50e5f4e10914) (Video)
28. [Mesh of Trees, Hypercube](https://invisiblenetwork.ai/learn/nptel/106103188/2cd6466cbaad) (Video)
29. [Hypercube cont'd](https://invisiblenetwork.ai/learn/nptel/106103188/55f754b1d555) (Video)
30. [Hypercube cont'd, butterfly network](https://invisiblenetwork.ai/learn/nptel/106103188/9fc021a98508) (Video)
31. [Butterfly, CCC and Benes Networks](https://invisiblenetwork.ai/learn/nptel/106103188/6ec00480551b) (Video)
32. [Butterfly, CCC and Benes Networks](https://invisiblenetwork.ai/learn/nptel/106103188/e044deeda330) (Video)
33. [Shuffle Exchange Graphs, de Bruijn Graphs](https://invisiblenetwork.ai/learn/nptel/106103188/a7f59b83b127) (Video)
34. [Interconnection Networks Algorithms](https://invisiblenetwork.ai/learn/nptel/106103188/c5fa364acc15) (Video)
35. [Circuit Value Problem is P-complete for NC-reductions](https://invisiblenetwork.ai/learn/nptel/106103188/ef24bb64918f) (Video)
36. [Ordered DFS is P-complete for NC-reductions](https://invisiblenetwork.ai/learn/nptel/106103188/5da8635c5c2a) (Video)
37. [Max Flow is P-complete for NC-reductions](https://invisiblenetwork.ai/learn/nptel/106103188/73143e14e5c9) (Video)