MPRI courses 2025-2026
This is a temporary page listing all MPRI courses in the academic year 2025-2026. Course details are subject to change.
The main MPRI website remains (for now) at the same location:
Usage tips
2025-2026 course list
Display: RESET Algorithms Complexity Parallel/Distributed Algo. Computer Algebra Automata/Games Verification Discrete Math/Graphs Geometry/Visual Data Semantic/Languages Logic/Proof Cryptography Quantum Bio-info Databases
Acronym | Title | ECTS | Hours | H/week | ↓ Language | Manager | Themes |
---|---|---|---|---|---|---|---|
aofa | Analysis of Algorithms Analyse d'algorithmes | 6 | 48 | 3 | ![]() ![]() | Élie de Panafieu | Algorithms, Discrete Math/Graphs |
compalg | Efficient Algorithms in Computer Algebra Algorithmes efficaces en calcul formel | 6* | 48 | 3 | ![]() ![]() | Vincent Neiger | Computer Algebra, Algorithms, Cryptography |
cgt | Computational Geometry and Topology Géométrie et topologie algorithmiques | 3 | 24 | 2.5 | ![]() ![]() | Steve Oudot | Algorithms, Geometry/Visual Data |
quantum | Quantum Computing Calcul quantique | 3 | 24 | 3 | ![]() ![]() | Frédéric Magniez | Quantum, Complexity, Algorithms |
podc | Principles of Distributed Computing Fondements du calcul distribué | 3 | 24 | 3 | ![]() ![]() | Carole Delporte | Parallel/Distributed Algo., Complexity, Algorithms |
lcrypt | Lattice-based Cryptography and Cryptanalysis Cryptographie basée sur les réseaux euclidiens | 3 | 24 | 1.5 | ![]() ![]() | Phong Nguyen | Cryptography, Algorithms |
approx | Approximation Algorithms Algorithmes d'approximation | 3 | 24 | 3 | ![]() ![]() | Chien-Chung Huang | Algorithms, Discrete Math/Graphs |
jeuxsto | Algorithms for Stochastic Games Algorithmes pour les jeux stochastiques | 3 | 24 | 3 | ![]() ![]() | Stéphane Le Roux | Automata/Games, Verification, Algorithms |
complb | Lower Bounds for Models of Computation Bornes inférieures pour modèles de calculs | 3 | 24 | 3 | ![]() ![]() | Sophie Laplante | Complexity, Algorithms |
paramalg | Parameterized Algorithms and Complexity Algorithmes et complexité paramétrés | 3 | 24 | 3 | ![]() | Valia Mitsou | Algorithms, Complexity, Discrete Math/Graphs |
heu | Solving Optimization Problems with Search Heuristics Résolution de problèmes d'optimisation avec heuristiques de recherche | 3 | 24 | 3 | ![]() | Carola Doerr | Algorithms, Complexity |
probas | Probability and Algorithmic Applications Probabilités et applications algorithmiques | 3 | 24 | 3 | ![]() | Claire Mathieu | Algorithms, Complexity |
combiaa | Algorithmic Aspects of Combinatorics Aspects algorithmiques de la combinatoire | 6 | 48 | 2.5 | ![]() | Guillaume Chapuy | Discrete Math/Graphs, Algorithms |
*: Courses marked with an asterisk are breakable: students can choose to validate only the first half of the course. In that case, the course counts for 3 ECTS.
Language: means the course is in English,
means it is in French.
means the teachers will adapt to the students. (Typically, this means course materials are in English, but the language during lectures will be adapted to the audience; see the course page for more information.)