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:

• Click on a theme to display courses with that theme.
• Click on a column to sort by that column.

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

Show all (remove filter/sort)

↓ 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
approx	Approximation Algorithms Algorithmes d'approximation	3	24	3		Chien-Chung Huang	Algorithms, Discrete Math/Graphs
codes	Error-Correcting Codes and Applications to Cryptography Codes correcteurs d'erreurs et applications à la cryptographie	3	24	1.5		Anne Canteaut	Cryptography, Discrete Math/Graphs
combiaa	Algorithmic Aspects of Combinatorics Aspects algorithmiques de la combinatoire	6	48	2.5		Guillaume Chapuy	Discrete Math/Graphs, Algorithms
disc	Distributed Computing for Graphs and Networks Calcul distribué sur graphes et réseaux	3	24	3		Pierre Fraigniaud	Parallel/Distributed Algo., Discrete Math/Graphs
geomgraphs	Algorithms and Combinatorics of Geometric Graphs Algorithmique et combinatoire des graphes géométriques	3	24	3		Luca Castelli Aleardi	Discrete Math/Graphs, Geometry/Visual Data
netmod	Foundations of Network Models Fondements sur la modélisation des réseaux	3	24	2.5		Ana Bušić	Parallel/Distributed Algo., Discrete Math/Graphs
paramalg	Parameterized Algorithms and Complexity Algorithmes et complexité paramétrés	3	24	3		Valia Mitsou	Algorithms, Complexity, Discrete Math/Graphs
qalco	Quantum Algorithms and Complexity Algorithmes et complexité quantiques	3	24	3		Simon Apers	Quantum, Complexity, Discrete Math/Graphs
qcc	Quantum Coding and Cryptography Codage et cryptographie quantiques	3	24	3		André Chailloux	Quantum, Cryptography, Discrete Math/Graphs
topics	Topological Methods in Computer Science Méthodes topologiques en informatique	3	24	3		Matěj Stehlík	Discrete Math/Graphs, Parallel/Distributed Algo., Geometry/Visual Data

*: 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.)