Lectures
Lectures 1 to 9 are given by Prof. Alexander Wolf. Lectures 10 to 18 are given by Prof. Daniel Rueckert.
- Lecture 10: Divide-and-conquer
- Lecture 11: Fourier transforms I
- Lecture 12: Fourier transforms II
- Lecture 13: Dynamic programming
- Lecture 14: Greedy algorithms
- Lecture 15: Compression
- Lecture 16: Shortest path and linear programming
- Lecture 17: Graphs and network flows
- Lecture 18: Graphs and network flows
Notes, tutorials and coursework can be found on CATE.