| 1 | Shared Memory Models - 1 | PDF unavailable |
| 2 | Shared Memory Models - 2 | PDF unavailable |
| 3 | Interconnection Networks | PDF unavailable |
| 4 | Cost and Optimality | PDF unavailable |
| 5 | Basic Techniques 1 | PDF unavailable |
| 6 | Basic Techniques 2 | PDF unavailable |
| 7 | Basic Techniques 3 | PDF unavailable |
| 8 | Basic Techniques 4 | PDF unavailable |
| 9 | Basic Techniques 5 | PDF unavailable |
| 10 | Odd Even Merge Sort (OEMS) | PDF unavailable |
| 11 | OEMS, Bitonic-Sort-Merge Sort (BSMS) | PDF unavailable |
| 12 | BSMS, Optimal List Colouring | PDF unavailable |
| 13 | Description | PDF unavailable |
| 14 | Analysis | PDF unavailable |
| 15 | Applications | PDF unavailable |
| 16 | Applications | PDF unavailable |
| 17 | Fast optimal merge algorithm | PDF unavailable |
| 18 | High level Description | PDF unavailable |
| 19 | Cole's Merge Sort: Details | PDF unavailable |
| 20 | Analysis of Cole's Merge Sort; Lower bound for sorting | PDF unavailable |
| 21 | Sorting Lower bound; Connected Components | PDF unavailable |
| 22 | Connected Components (CREW) | PDF unavailable |
| 23 | Connected Components, Vertex Colouring | PDF unavailable |
| 24 | Sorting on a 2D mesh | PDF unavailable |
| 25 | Sorting on a 2D mesh | PDF unavailable |
| 26 | Sorting, Offline routing on a 2D mesh | PDF unavailable |
| 27 | Sorting on a 3D mesh | PDF unavailable |
| 28 | Mesh of Trees, Hypercube | PDF unavailable |
| 29 | Hypercube cont'd | PDF unavailable |
| 30 | Hypercube cont'd, butterfly network | PDF unavailable |
| 31 | Butterfly, CCC and Benes Networks | PDF unavailable |
| 32 | Butterfly, CCC and Benes Networks | PDF unavailable |
| 33 | Shuffle Exchange Graphs, de Bruijn Graphs | PDF unavailable |
| 34 | Interconnection Networks Algorithms | PDF unavailable |
| 35 | Circuit Value Problem is P-complete for NC-reductions | PDF unavailable |
| 36 | Ordered DFS is P-complete for NC-reductions | PDF unavailable |
| 37 | Max Flow is P-complete for NC-reductions | PDF unavailable |