The M1 year is organized by each of the Master partners.

The Paris 7 M1 is organized by UFR d'Informatique.

The Ecole Polytechnique M1 is organized by Dept. Informatique.

ENS Paris and ENS Cachan organize a joint M1 curriculum
described here

The kickoff meeting will take place on Monday, September 15 at 10:30
in salle des thèses, 580F, 5th floor, secteur F, la Halle aux farines, 10-16 rue Françoise Dolto, 75013 Paris, Métro : ligne 14, RER C : Bibliothèque F. Mitterrand.
A small buffet will be organized after the meeting.

The Slides of the Kickoff Meeting 2014

The lectures will start on Monday, September 15 at 12:45.

There will be a Christmas break from December 20 2014 until January 4, 2015 (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 15 2014 until November 22 2014 : first lecture period.

From November 24, 2014 until December 5, 2014 : final or mid-term exams.

From December 8, 2014 until February 28, 2015 : second lecture period.

From March 2, 2015 until March 13, 2015 : exams.

M2 lectures take place in Batiment Sophie Germain

Research internships last 4.5 months (at least) and may start from March 16, 2014.
Internships are typically defended the first week of September.

Sep. 30: submission of a module selection

Nov. 15: canceling registration to 1st period modules

Jan. 15: canceling registration to 2nd period modules

Jan. 31: submission of an internship choice

Apr. 30: retaking exams requests

Jul. 31: retaking exams

Aug. 21: internship reports upload

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, courses that last 2.5 hours start at the beginning of the slot.

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

** Slot ** | ** Course ** | ** Room ** | **Period(s)** | ** Notes on starting time ** |

Monday 8:45 | 2.3 Concurrency
2.38.1 Algorithms and combinatorics for geometric graphs
2.13.1 Polynomial systems, computer algebra, and applications | 1009
1008
1008 | 1-2
1
2 | |

Monday 12:45 | 2.29.1 Graph algorithms
2.20.2 Mathematical foundations of automata theory | 1009
1009 | 1-2
1-2 |
middle of the slot |

Monday 16:15 | 2.1 Linear logic and logical paradigms of computation
2.12.2 Arithmetic algorithms for cryptology
2.12.1 Techniques in cryptography and cryptoanalysis | 1009
1008
1008 | 1-2
1-2
1-2 |
middle of the slot |

Tuesday 8:45 | 2.19 Computational methods for systems and synthetic biology
2.18.2 Distributed algorithms on shared memory
2.17.1 Foundations of network models | 1009
CANCELLED
1008 | 1-2
CANCELLED
2 | |

Tuesday 12:45 | 2.24.1 Optimization
2.23.1 Synchronous systems
2.37.1 Semantics, languages and algorithms for multicore programming | 1009
1008
1009 | 1
1
2 | |

Tuesday 16:15 | 2.10 Algorithmic aspects of combinatorics
2.27.1 Computational structures and logics for natural language modelling
2.8.2 Foundations of real-time and hybrid systems | 1009
1008
1008 | 1-2
1
2 | |

Wednesday 8:45 | 2.6 Abstract interpretation: application to verification and static analysis | 1009 till Xmas (2027 after) | 1-2 | |

Wednesday 12:45 | 2.16 Finite automata modelling
2.30 Cryptographic protocols: formal and computational proofs | 1009
1008 | 1-2
1-2 | |

Wednesday 16:15 | 2.33.1 Theory of computations
2.7.1 Foundations of proof systems | 1009
1008 | 1
1 | |

Thursday 8:45 | 2.8.1 Non-sequential theory of distributed systems
2.5.1 Automated deduction
2.18.1 Distributed algorithms on networks
2.13.2 Error correcting codes and applications to cryptography | 2035
2035 till Xmas (1009 after)
1008
1008 | 1
2
1-2
1-2 |
middle of the slot |

Thursday 12:45 | 2.15 Analysis of algorithms
2.9.1 Mathematical foundations of the theory of infinite transition systems
2.26.2 Web data management | 1009
1008
1008 | 1-2
1
2 | |

Thursday 16:15 | 2.11.1 Randomized algorithms
2.36.1 Proof of programs
2.9.2 Algorithmic verification of programs | 1009
1009
1008 | 1
2
1 | |

Friday 8:45 | 2.2 Models of programming languages: domains, categories, games
2.14.1 Computational geometry learning | 1009
1008 | 1-2
1 | |

Friday 12:45 | 2.4 Functional programming and type systems
2.11.2 Randomness in complexity
2.34.1 Quantum information and applications | 1009
1008
1008 | 1-2
1
2 | |

Friday 16:15 | 2.22 Efficient algorithms in computer algebra
2.20.1 Game theory techniques in computer science
2.7.2 Proof assistants | CANCELLED
1008
1008 | CANCELLED
1
2 | |

**Slot** | **Course** | ** Room ** | **Period(s)** | ** Notes on starting time ** |

2014-15 Calendar,
2013-14 Calendar, 2012-13 Calendar.