The M1 year is organized by each of the partner institutions.
The kickoff meeting will take place on Monday
September 16th, 2024 at 10:00 in the Turing amphitheater, on the ground floor of the Sophie Germain building
(the main entrance is shown on this map).
The address is of the Sophie Germain building is
8 place Aurélie Nemours
75013 Paris
Slides of the kickoff meeting 2024-2025.
The lectures will start on Tuesday, September 17th at 8:45.
There will be a winter break from Saturday, December 21st, 2024 until Sunday, January 5th, 2025
(included). There is no other break.
The M2 lectures are divided in two periods of 10 weeks, each period is
followed by 2 weeks of examinations.
From September 17th, 2024 until November 22nd, 2024: first lecture period.
From November 25th, 2024 until December 6th, 2024: final or mid-term exams.
From December 9th, 2024 until February 28th, 2025: second lecture period.
From March 3rd, 2025 until March 14, 2025: exams.
M2 lectures take place in Batiment Sophie Germain
Research internships last 4.5 months (at least) and may start from March
15th, 2025. Internships are typically defended the first week of September.
Sep. 30: submission of a study plan (on the pedagogical server)
Jan. 15: canceling or adding registration to modules (on the pedagogical server, via your Study Director). NB you cannot cancel MPRI modules for which you passed mid-term or final exams.
Jan. 31: submission of an internship choice (on the pedagogical server)
Mar. 31: submission of courses' evaluations (on the pedagogical server)
Apr. 30: retaking exams requests (by email to the Professor in charge of the course, with copy to the Master Director)
Jul. 31: retaking exams (by appointment)
Aug. 20: internship reports upload (on the pedagogical server)
All courses take place in the Sophie Germain building, room 1002 or 1004.
Period 1
| Day | Slot | Room 1002 | Room 1004 |
| Monday | 8:45 | 8:45>11:45 - 2.6 Abstract Interpretation: Application to Verification and Static Analysis | 8:45>11:45 - 2.7.2 Proof Assistants |
| 12:45 | 12:45>15:45 - 2.15 Analysis of Algorithms | 12:45>15:45 - 2.27.1 Computational and Logical Structures for Linguistic Modeling |
| 16:15 | 16:15>19:15 - 2.18.2 Shared-Memory Distributed Computing | 16:15>19:15 - 2.22 Efficient Algorithms in Computer Algebra |
| Tuedsay | 8:45 | 8:45>11:45 - 2.14.1 Computational Geometry and Topology | 8:45>11:45 - 2.23.1 Synchronous Reactive Systems |
| 12:45 | 12:45>15:45 - 2.4 Functional Programming and Type Systems | 12:45>15:45 - 2.20.1 Game Theory in Computer Science |
| 16:15 | 16:15>19:15 - 2.7.1 Foundations of Proof Systems | 16:15>19:15 - 2.11.2 Randomness in Complexity |
| Wednesday | 8:45 | 8:45>10:15 - 2.13.2 Error-Correcting Codes and Applications to Cryptography | 8:45>11:45 - 2.38 Algorithms and Combinatorics for Geometric Graphs |
| 10:15>11:45 - 2.12.1 Techniques in Cryptography and Cryptanalysis |
| 12:45 | 12:45>15:45 - 2.16 Finite Automata Modeling | 12:45>15:45 - 2.29.1 Advanced Graph Theory |
| 16:15 | 16:15>19:15 - 2.2 Models of Programming Languages: Domains, Categories, Games | 16:15>19:15 - 2.30 Proofs of Security Protocols |
| Thursday | 8:45 | 10:15>11:45 - 2.18.1 Distributed Algorithms for Networks | 8:45>11:45 - 2.33.3 Complexity over the Reals |
| 12:45 | 12:45>15:45 - 2.8.2 Cyber-physical systems and their verification | 12:45>15:45 - 2.40 Probabilistic programming languages |
| 16:15 | 16:15>19:15 - 2.24.1 Algorithms and Uncertainty | |
| Friday | 8:45 | 8:45>11:45 - 2.12.2 Arithmetic Algorithms for Cryptography | 8:45>11:45 - 2.9.1 Algorithmic Aspects of Well Quasi-Order Theory |
| 12:45 | 12:45>15:45 - 2.34.1 Quantum Information and Applications | 12:45>15:45 - 2.10 Algorithmic Aspects of Combinatorics |
Period 2
| Day | Slot | Room 1002 | Room 1004 |
| Monday | 8:45 | 8:45>11:45 - 2.6 Abstract Interpretation: Application to Verification and Static Analysis | 8:45>11:45 - 2.17.1 Foundations of Network Models |
| 12:45 | 12:45>15:45 - 2.15 Analysis of Algorithms | 12:45>15:45 - 2.19 Biochemical Programming |
| 16:15 | | 16:15>19:15 - 2.22 Efficient Algorithms in Computer Algebra |
| Tuedsay | 8:45 | 9:45>11:45 - 2.20.2 Symbolic Dynamics (Lecture) | |
| 12:45 | 12:45>15:45 - 2.4 Functional Programming and Type Systems | 12:45>15:45 - 2.34.2 Quantum Information and Cryptography |
| Wednesday | 8:45 | 8:45>10:15 - 2.13.2 Error-Correcting Codes and Applications to Cryptography | 8:45>11:45 - 2.36.1 Proof of Programs |
| 10:15>11:45 - 2.12.1 Techniques in Cryptography and Cryptanalysis |
| 12:45 | 12:45>15:45 - 2.16 Finite Automata Modeling | 13:45>15:45 - 2.11.1 Parameterized Algorithms (Lecture) |
| 16:15 | 16:15>19:15 - 2.2 Models of Programming Languages: Domains, Categories, Games | 16:15>19:15 - 2.30 Proofs of Security Protocols |
| Thursday | 8:45 | 10:15>11:45 - 2.18.1 Distributed Algorithms for Networks | 8:45>11:45 - 2.24.2 Solving Optimization Problems with Search Heuristics |
| 12:45 | 12:45>13:45 - 2.20.2 Symbolic Dynamics (Tutorial) | 12:45>15:45 - 2.29.2 Theory of Practical Graph Algorithms |
| Friday | 8:45 | 8:45>11:45 - 2.3.1 Concurrency | 8:45>11:45 - 2.26.1 Querying Data: Foundations and Practice |
| 12:45 | 12:45>15:45 - 2.9.2 Algorithmic Verification of Programs | 12:45>15:45 - 2.10 Algorithmic Aspects of Combinatorics |
| 16:15 | | 16:15>17:15 - 2.11.1 Parameterized Algorithms (Tutorial) |