The M1 year is organized by each of the partner institutions.
The kickoff meeting will take place on Monday, September 12, 2016 at 10:30
in salle des thèses, 580F, 5th floor, sector F, la Halle aux farines building.
Addess: 10-16 rue Françoise Dolto, 75013 Paris. Métro : ligne 14, RER C : Bibliothèque F. Mitterrand.
Beware that the access to the room is slightly tricky:
once you are on the ground floor of the Halle aux farines building, go to sector E, even numbers side, and take elevator (or stairs) to sector F.
A small buffet will be organized between the end of the meeting and the beginning of the courses.
Slides of the kickoff meeting 2016-2017.
The lectures will start on Monday, September 12 at 12:45.
There will be a Christmas break from December 17 2016 until January 2, 2017 (bounds 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 12 2016 until November 18 2016 : first lecture period.
From November 21, 2016 until December 2, 2016 : final or mid-term exams.
From December 5, 2016 until February 24, 2017 : second lecture period.
From February 27, 2017 until March 10, 2017 : exams.
M2 lectures take place in Batiment Sophie Germain
Research internships last 4.5 months (at least) and may start from March 13, 2015.
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. 21: internship reports upload (on the pedagogical server)
All courses take place in rooms located in building Sophie Germain.
The schedule specifies whether the course is taught in period 1, period 2, or both periods (1-2).
Slots last 3 hours with default starting time: 8:45 in the morning, 12:45 at midday, and 16:15 in the evening.
Unless announced otherwise on the page of the course, the default starting time for courses that last 2.5 hours is the beginning of the slot. Similarly, by default, courses start the first week of each period.
For a course that lasts 1.5 hours, the last column mentions whether it starts in the middle of the slot (10:15, 14:30, 17:45).
The first 3 lectures of the course 2.37.1 Semantics, languages and algorithms for multicore programming (period 2)
will actually take place on Monday in the midday slot (12:45–15:45).
NEW: there will also be a special session on
Monday, February 13 (12:45–15:45).
Consult the page of the course for more detailed informations.
| Slot | Course | Room | Period(s) | Notes |
| Monday 8:45 | 2.33.1 Theory of computations
2.3.2 Foundations of privacy
2.13.1 Polynomial systems, computer algebra, and applications | 2035
2036
2035 | 1
1
2 | |
| Monday 12:45 | 2.11.2 Randomness in complexity
2.20.2 Mathematical foundations of automata theory | 2035
2036 | 1
1-2 |
2.20.2 starts at 13:15
|
| Monday 16:15 | 2.14.1 Computational geometry learning
2.7.2 Reading group on HTT
2.12.1 Techniques in cryptography and cryptoanalysis
2.12.2 Arithmetic algorithms for cryptology | 2035
2035
2036
2036 | 1
2
1-2
1-2 |
2.12.2 middle of the slot |
| Tuesday 8:45 | 2.9.2 Algorithmic verification of programs
2.29.1 Graph algorithms
2.29.2 Graph mining | 2035
2036
2036 | 2
1
2 | |
| Tuesday 12:45 | 2.24.1 Optimization
2.37.1 Semantics, languages and algorithms for multicore programming
2.23.1 Synchronous systems
2.17.1 Foundations of network models | 2035
2036
2036
2035 | 1
2
1
2 |
2.37.1 see msg above
2.17.1 starts at 13:15 |
| Tuesday 16:15 | 2.1 Linear logic and logical paradigms of computation
2.22 Efficient algorithms in computer algebra | 2035
2036 | 1-2
1-2 | |
| Wednesday 8:45 | 2.6 Abstract interpretation: application to verification and static analysis
2.8.1 Non-sequential theory of distributed systems
2.26.1 Logic, descriptive complexity, and database theory | 2035
2036
2036 | 1-2
1
2 | |
| Wednesday 12:45 | 2.16 Finite automata modelling
2.27.1 Computational structures and logics for natural language modelling
2.3.1 Concurrency | 2035
2036
2036 | 1-2
1
2 | |
| Wednesday 16:15 | 2.11.1 Randomized algorithms
2.8.2 Foundations of real-time and hybrid systems
2.36.1 Proof of programs | 2035
2036
2036 | 1
1
2 | |
| Thursday 8:45 | 2.20.1 Game theory techniques in computer science
2.26.2 Web data management
2.13.2 Error correcting codes and applications to cryptography
2.18.1 Distributed algorithms on networks | 2035
2035
2036
2036 | 1
2
1-2
1-2 |
2.18.1 middle of the slot |
| Thursday 12:45 | 2.18.2 Distributed algorithms on shared memory
2.7.1 Foundations of proof systems
2.7.2 Proof assistants
2.24.2 Optimization and search heuristics | 2035
2036
2036
2035 | 1
1
2
2 | |
| Thursday 16:15 | 2.38.1 Algorithms and combinatorics for geometric graphs
2.19 Computational methods for systems and synthetic biology | 2035
2036 | 1
1-2 | |
| Friday 8:45 | 2.15 Analysis of algorithms
2.30 Cryptographic protocols formal and computational proofs | 2035
2036 | 1-2
1-2 | |
| Friday 12:45 | 2.9.1 Mathematical foundations of the theory of infinite transition systems
2.34.1 Quantum information and application
2.4 Functional programming and type systems | 2035
2035
2036 | 1
2
1-2 | 2.9.1 is suspended as M2-MPRI course but continues as ENSC course
|
| Friday 16:15 | 2.10 Algorithmic aspects of combinatorics
2.2 Models of programming languages: domains, categories, games | 2036
2035 | 1-2
1-2 | |
| Slot | Course | Room | Period(s) | Notes |
2015-16 Calendar,
2014-15 Calendar,
2013-14 Calendar, 2012-13 Calendar.