- Module IN2157
- Lecture: Tuesday 8:25 - 9:55 in MI 00.13.009A (starting on Oct 25 due to the "Introductory week")
- Language: English

- Fundamentals: models of computation, complexity measures
- Sorting: Bubble-Sort, Merge-Sort, Quick-Sort, Median-Algorithms, lower bounds, sorting in parallel
- Searching: hashing, search tress, etc.
- Arithmetic problems: parallel prefix computation, parallel matrix and vector operations
- Foundations of parallel algorithms and simple models of parallel computation
- Algorithms on (weighted) graphs: traversals, shortest paths, etc.

For parallel algorithms, see Berman, Paul: Algorithms: Sequential, Parallel, and Distributed, or JaJa: Introduction to Parallel Algorithms

- Lecture 1
- Homework 1
- Solution to homework 1
- Lecture 2
- Homework 2
- Solution to homework 2
- Lecture 3
- Homework 3
- Solution to homework 3
- Lecture 4
- Homework 4
- Solution to homework 4
- Lecture 5
- Homework 5
- Solution to homework 5
- Lecture 6
- Homework 6
- Solution to homework 6
- Lecture 7
- Homework 7
- Solution to homework 7
- Homework 8
- Solution to homework 8
- Lecture 8
- More details on graph traversal
- Homework 9
- Solution to homework 9
- Lecture 9
- Homework 10
- Solution to homework 10
- Material on network flows (Lecture 10 discussed pp. 1-40)
- Lecture 11 (older material on recurrences and master theorem)
- Homework 11
- Solution to homework 11