Parisian Master of Research in Computer Science

Master Parisien de Recherche en Informatique (MPRI)

[Home page]

[How to contact us]
[How to apply]
[Entrance requirements]
[Management]

[The MPRI course]

[Organisation]
[Standard courses]
[Level 1 modules]
[Level 2 modules]
[Teaching staff]

[Practical information]

[Calendar and timetable]
[Student directory]
[Examinations calendar]
[Internships]
[Scolarships]

2010-2011 Agenda

M1

The M1 year is organized by each of the university partners. The Paris 7 M1 is a curriculum of the master Ingénierie Informatique. All informations about the MPRI M1 should therefore be available on these pages.

The students enrolled in the MPRI M1 at ENS Cachan or ENS Paris follow a curriculum, that is designed with the agreement of the representative of their home university in the studies committee. They must attend the kickoff meeting of the M2 year, which is precised below.

M2

The kickoff meeting will take place on Monday, September 13rd at 10:00 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 lectures will start on Monday, september 13rd at 12:45.

There will be a Christmas break from December 18th until Jan 2nd, 2011. 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 Sept 13rd 2010 until Nov. 20th 2010 : first lecture period.
From Nov 22nd, 2010 until Dec. 3rd, 2010 : final or mid-term exams.
From Dec. 6th, 2010 until Feb. 26th, 2011 : second lecture period.
From Feb 28th, 2011 until March 11th, 2011 : exams.

Research internships last 4.5 months (at least) and may start from March 14th, 2011.

2010-2011 Calendar (preliminary version)

	8:45 -- 9:15	9:15 -- 10:15	10:15 -- 11:45	12:45 -- 13:15	13:15 -- 14:15	14:15 -- 15:45	16:15 -- 17:45	17:25 -- 18:45	18:45 -- 19:15
Monday	2.26.1 Logique, complexité descriptive et théorie des bases de données Logic, descriptive complexity and theory of databases Period 1, 8 lectures Chevaleret 0D4			2.27.1 Structures Informatiques et Logiques pour la Modélisation Linguistique Period 1, 8 lectures Chevaleret 0D4			2.19 Méthodes informatiques pour la biologie systémique et synthétique Bioinformatics Period 1 and Period 2, 16 lectures Chevaleret 0D4
		2.18 Algorithmique répartie et tolérance aux défaillances Distributed algorithms and fault tolerance Period 1 and Period 2, 20 lectures Chevaleret 0D1			2.12.1 Cryptanalyse Cryptanalysis Period 1, 10 lectures Ulm salle R		2.14.2 Géométrie, Algorithmes et Combinatoire Geometry, algorithms and combinatorics Period 1, 10 lectures Ulm salle R
	1.20 Catégories, lambda-calculs Period 1 and Period 2, 16 lectures Ulm salle R
	8:45 -- 9:15	9:15 -- 10:15	10:15 -- 11:45	12:45 -- 13:15	13:15 -- 14:15	14:15 -- 15:45	16:15 -- 17:45	17:25 -- 18:45	18:45 -- 19:15
Tuesday		2.7.1 Fondements des systèmes de preuves Foundations of proof systems Period 1, 10 lectures Chevaleret 0D4			2.4 Programmation fonctionnelle et systemes de types Functional programming and type systems Period 1 and Period 2, 20 lectures Chevaleret 0D4		2.5 Démonstration automatique Automated deduction Period 1 and Period 2, 20 lectures Chevaleret 0D4
	2.17.2 Algorithmique distribuée pour les réseaux Distributed algorithms for the networks Period 1 and Period 2, 16 lectures Chevaleret 0D1		2.29.1 Algorithmique des graphes Graph algorithms Period 1 and Period 2, 16 lectures Chevaleret 0D1			2.12.2 Algorithmes arithmétiques pour la cryptologie Arithmetic algorithms for cryptology Period 1 and Period 2, 16 lectures Ulm salle UV	2.22 Algorithmes efficaces en calcul formel Efficient algorithms in computer algebra Period 1 and Period 2, 16 lectures Chevaleret 0D1
	2.7.2 Assistants de preuves Proof assistants Period 2, 8 lectures Chevaleret 0D4			1.19 Planification de mouvement en robotique Period 1 and Period 2, 16 lectures Ulm Salle R			1.22 Basics of Verification Period 1 and Period 2, 20 lectures Chevaleret
	8:45 -- 9:15	9:15 -- 10:15	10:15 -- 11:45	12:45 -- 13:15	13:15 -- 14:15	14:15 -- 15:45	16:15 -- 17:45	17:25 -- 18:45	18:45 -- 19:15
Wednesday	2.30 Protocoles cryptographiques : preuves formelles et calculatoires Cryptographic protocols: computational and symbolic proofs Period 1 and Period 2, 16 lectures Ulm salle R			2.11.1 Algorithmique avancée et complexité Advanced algorithmics and complexity Period 1, 8 lectures Chevaleret 0D4			2.23.1 Systèmes synchrones Synchronous systems Period 1, 8 lectures Ulm salle UV
	2.20.1 Techniques de théorie des jeux en informatique Game theory techniques in computer science Period 1 and Period 2, 16 lectures Chevaleret 0D4		2.20.2 Fondations mathématiques de la théorie des automates Mathematical foundations of automata theory Period 1 and Period 2, 16 lectures Chevaleret 0D4	2.2 Modèles des langages de programmation: domaines, catégories, jeux Models of programming languages: domains, categories, games Period 1 and Period 2, 16 lectures Chevaleret 0D1			2.14.1 Analyse Géométrique des Données Computational Geometry Learning Period 1, 10 lectures Chevaleret 0D4
	1.17 Complexité avancée Advanced complexity theory Period 1 and Period 2, 16 lectures Chevaleret			1.18 Automates d'arbres et applications Tree automata and applications Period 1 and Period 2, 16 lectures Chevaleret			2.34.1 Utilisation du hasard en informatique Using randomness in computer science Period 2, 8 lectures Chevaleret 0D4
				2.11.2 Informatique quantique et applications Quantum Information and Applications Period 2, 8 lectures Chevaleret 0D4
	8:45 -- 9:15	9:15 -- 10:15	10:15 -- 11:45	12:45 -- 13:15	13:15 -- 14:15	14:15 -- 15:45	16:15 -- 17:45	17:25 -- 18:45	18:45 -- 19:15
Thursday	2.8 Fondements pour la vérification des systèmes temps-réel Foundations of real time systems verification Period 1 and Period 2, 16 lectures Chevaleret 0D4			2.3 Concurrence Concurrency Period 1 and Period 2, 16 lectures Chevaleret 0D4			2.13.1 Systèmes polynomiaux, calcul formel et applications Polynomial systems, computer algebra and applications Period 1 a0D4 nd Period 2, 16 lectures Chevaleret	2.13.2 Codes correcteurs d'erreurs et applications à la cryptographie Error correcting codes and applications to cryptography Period 1 and Period 2, 16 lectures Chevaleret 0D4
Thursday	2.24.1 Optimisation Optimization Period 1 and Period 2, 16 lectures Chevaleret		2.31.1 Algorithmique et complexité des problèmes de satisfaction de contraintes Constraint Satisfaction Problems: algorithms and complexity Period 1 and Period 2, 16 lectures Chevaleret 0D1		2.10 Aspects algorithmiques de la combinatoire Algorithmic aspects of combinatorics Period 1 and Period 2, 20 lectures Chevaleret		2.33.1 Théorie des calculs Theory of computations Period 1 and Period 2, 16 lectures Chevaleret 0D1
	8:45 -- 9:15	9:15 -- 10:15	10:15 -- 11:45	12:45 -- 13:15	13:15 -- 14:15	14:15 -- 15:45	16:15 -- 17:45	17:25 -- 18:45	18:45 -- 19:15
Friday	2.6 Interprétation abstraite: application à la vérification et à l'analyse statique Abstract interpretation: application to verification and static analysis Period 1 and Period 2, 16 lectures Ulm salle UV				2.1 Logique linéaire et paradigmes logiques du calcul Linear logic Period 1 and Period 2, 20 lectures Chevaleret 0D1		2.17.1 Fondements sur la modélisation des réseaux Foundantions of network models Period 1, 10 lectures Ulm salle R
	2.16 Modélisation par automates finis Finite automata modelisation Period 1 and Period 2, 16 lectures Chevaleret 0D4				2.9 Vérification de systèmes dynamiques et paramétrés verification of parametrized and dynamic systems Period 1 and Period 2, 20 lectures Chevaleret 0D4
	1.24 Probabilistic systems Period 1 and Period 2, 16 lectures Chevaleret

Parisian Master of Research in Computer Science

Master Parisien de Recherche en Informatique (MPRI)

2010-2011 Agenda

M1

M2

2010-2011 Calendar (preliminary version)

Les années précédentes