- Reductions and NP-hardness [slides][notes]
- A few NP-hard problems [slides]
- Algorithms for vertex cover [slides][notes]
- Greedy algorithm for set Cover [slides][notes]
- Scheduling on a single machine [slides][notes]
- Local search and scheduling jobs on identical parallel machines [slides]
- The knapsack problem [slides]
- The k-center problem[slides][notes]
- Randomized approximation algorithm for MAX 3-SAT [slides][notes]
- Randomized selection [slides][notes]
- Quicksort [slides][notes]
- Random binary search trees [slides][notes]
- Tail inequalities [slides][notes]
- Randomized distributed algorithms [slides]
- Minimum spanning trees and union-find [slides]
- Convex hulls [slides]
- Multithreaded algorithms I [slides][notes]
- Multithreaded algorithms II [slides]
- Multithreaded algorithms III: merge sort [slides][notes]
- Fast Fourier transform I [slides]
- Fast Fourier transform II [slides][notes]
- Fast Fourier transform III [slides]
- Quantum algorithms I [slides][notes]
- Quantum algorithms II [slides][notes]
- Quantum algorithms III [slides]
- Quantum algorithms IV [slides]