Algorithms I
Instructor: Stéphane Thomassé
Institution: ENS de Lyon
Year: 2024–2025
Course notes
You can find my course notes here (in French).
Course chapters
- Introduction
- Paradigm : Divide and Conquer
- Greedy Algorithms
- Uniform Random Generation
- NP-completeness
- Dynamic Programming
- Amortized analysis
- Approximation
- Randomized Algorithms
- Exact Exponential Algorithms