We teach students about theoretical aspects of algorithms. Topics include:
- computation models;
- recursive algorithms;
- worst-case complexity;
- lower bounds complexity;
- complexity classes and reduction.
By studying the Gale-Shapley algorithms and examining different voting methods, we also focus on the importance of algorithms in real life.
Finally, we give two introductory lectures on quantum algorithmic.