The M1 year is organized by each of the partner institutions.
The kickoff meeting will take place on Monday,
September 11, 2017 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 2017-2018.
The lectures will start on Monday, September 11 at 12:45.
There will be a Christmas break from December 23 2017 until January 7, 2018
(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 11 2017 until November 17 2017 : first lecture period.
From November 20, 2017 until December 1, 2017 : final or mid-term exams.
From December 4, 2017 until February 23, 2018 : second lecture period.
From February 26, 2018 until March 9, 2018 : 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. 20: 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:15, 17:45).
Monday
8h45 | 2.10: Algorithmic aspects of combinatorics
2.8.1: Non-sequential theory of distributed systems
2.13.1: Polynomial Systems, computer algebra, and applications | 2036
2035
2035 | 1-2
1
2 |
|
Monday
12h45 | 2.11.2: Randomness in complexity
2.16: Finite automata modelling | 2036
2035 | 1
1-2 |
|
Monday
16h15 | 2.35.1: Constraint programming
2.26.2: Web data management
2.14.1: Computational geometry learning | 2036
2035
2035 | 1
2
1 |
|
Tuesday
8h45 | 2.29.1: Graph algorithms
2.29.2: Graph mining
2.37.1: Semantics, languages and algorithms for multicore programming | 2036
2036
2035 | 1
2
2 |
|
Tuesday
12h45 | 2.23.1: Synchronous systems
2.24.1: Optimization
2.12.2: Arithmetic algorithms for cryptology | 2036
2035
2035 | 1
1
2 |
|
Tuesday
16h15 | 2.34.1: Quantum information
2.15: Analysis of algorithms
2.12.1: Techniques in cryptographic and cryptoanalysis | 2036
2035
2036 | 1
1-2
2 |
|
Wednesday
8h45 | 2.30: Cryptographic protocols: formal and computational proofs
2.6: Abstract interpretation: application to verification and static analysis | 2036
2035 | 1-2
1-2 |
|
Wednesday
12h45 | 2.36.1: Proof of programs
2.11.1: Randomized algorithms
2.19: Computational methods for systems and synthetic biology | 2036
2036
2035 | 2
1
1-2 |
|
Wednesday
16h15 | 2.34.2: Quantum information and cryptography
2.27.1: Computational structures and logics for natural language modelling
2.39 : Computer Graphics and Visualization | 2035
2035
2036 | 2
1
1-2 |
first half of slot |
Thursday
8h45 | 2.2: Models of programming languages: domains, categories, games
2.13.2: Error correcting codes and applications to cryptography
2.18.1: Distributed algorithms on networks | 2036
2035
2035 | 1-2
1-2
1-2 |
second half of slot
first half of slot |
Thursday
12h45 | 2.7.1: Foundations of proof systems
2.38.1: Algorithms and combinatorics for geometric graphs
2.3.2: Foundations of privacy | 2036
2035
2035 | 1
1
2 |
|
Thursday
16h15 | 2.22: Efficient algorithms in computer algebra
2.7.2: Proof assistants
2.20.1: Game theory techniques in computer science | 2036
2035
2035 | 1-2
2
1 |
|
Friday
8h45 | 2.18.2: Distributed algorithms on shared memory
2.24.2 Optimization and Search Heuristics
2.8.2: Foundations of real-time and hybrid systems
2.9.2: Algorithmic verification of programs | 2036
2035
2035
2036 | 1
2
1
2 |
|
Friday
12h45 | 2.9.1: Well-Quasi-Orders for Algorithms
2.4: Functional programming and type systems
2.33.1: Circuit complexity | 2036
2035
2036 | 1
1-2
2 |
|
Friday
16h15 | 2.17.1: Foundations of network models
2.1: Linear logic and logical paradigms of computation | 2036
2035 | 2
1-2 |
|
2015-16 Calendar,
2015-16 Calendar,
2014-15 Calendar,
2013-14 Calendar,
2012-13 Calendar