← Back to the catalogue

Level 2 · M.Sc

Advanced Algorithms & Data Structures

MSc syllabus · 42 phases · ~1 year

Every unit this programme teaches, in the order it is taught. Headlines only — the material itself opens once you are enrolled.

Dates, price and prerequisites

1. Phase 0 Bridge & research foundations: from engineer to researcher
2. Phase 1 Analysis at depth
3. Phase 2 Probability for algorithms
4. Phase 3 Lower bounds
5. Phase 4 Models of computation
6. Phase 5 Experimental algorithmics
7. Phase 6 Self-adjusting structures
8. Phase 7 Randomized structures
9. Phase 8 Advanced priority queues
10. Phase 9 Advanced hashing
11. Phase 10 Range-query & offline structures
12. Phase 11 Persistent data structures
13. Phase 12 Succinct data structures
14. Phase 13 Suffix structures at depth
15. Phase 14 Advanced string algorithms
16. Phase 15 Randomized algorithms I
17. Phase 16 Randomized algorithms II
18. Phase 17 Approximation algorithms I
19. Phase 18 Approximation algorithms II
20. Phase 19 Online algorithms
21. Phase 20 Streaming algorithms I
22. Phase 21 Streaming algorithms II
23. Phase 22 Sketching & dimensionality
24. Phase 23 Advanced shortest paths
25. Phase 24 Maximum flow at depth
26. Phase 25 Min-cost flow & assignment
27. Phase 26 Matchings
28. Phase 27 Dynamic graph algorithms
29. Phase 28 Graph decompositions
30. Phase 29 Planar & structured graphs
31. Phase 30 Geometric primitives & convex hulls
32. Phase 31 Sweep-line & proximity
33. Phase 32 Voronoi diagrams & Delaunay triangulation
34. Phase 33 Range searching & geometric optimization
35. Phase 34 Algebraic & number-theoretic algorithms
36. Phase 35 NP-completeness at research depth
37. Phase 36 Parameterized complexity I
38. Phase 37 Parameterized complexity II
39. Phase 38 Fine-grained complexity
40. Phase 39 Exact exponential algorithms & DP optimization
41. Phase 40 Counting & inapproximability
42. Phase 41 SAT solvers as research tools