Parisian Master of Research in Computer Science
Master Parisien de Recherche en Informatique (MPRI)

Level 2 modules

Level 2 modules offer a specialised training constitutive of a true introduction to research; they require a good knowledge of the contents of the level 1 modules. Each level 2 full module is taught over the course of a semester, represents 75 student-hours (typically 50 contact hours and 25 hours of private study), and entitles students to 6 ECTS credits. Half modules are taught either 1.5h/week over the course of the semester or 3h/week over half the semester. Each such module represents 37.5 student-hours and entitles students to 3 ECTS credits.

At least twenty level 2 modules will be made available for the first semester exclusively. The MPRI's Executive Committee will set a list of level 2 modules each year; the modules thus selected will of course only be actually maintained if they attract a sufficient number of students. The level 2 modules will be taught preferably on the premises of the university of Paris 7. The table herebelow contains a list of titles and heads of level 2 modules as well as links to a description of each module.

List of level 2 modules

Courses marked with a (S) are suspended in the academic year 2017-2018

Module Title Nb. H ECTS Period(s) Nb. Week H/Week Person(s) in charge Teaching LanguageBreakable
2.1 Logique linéaire et paradigmes logiques du calcul
Linear logic and logical paradigms of computation
48 6 1-2 16 3 D. Kesner 3/4 French by default, 1/4 English
2.2Modèles des langages de programmation: domaines, catégories, jeux
Models of programming languages: domains, categories, games
48 6 1-2 16 3 P.-A. MellièsEnglish upon request
2.3.1 Concurrence
Concurrency
24 3 2 8 3 E. Haucourt French by default
2.3.2(S) Fondements de la confidentialité des données
Foundations of privacy
24 3 2 8 3 C. Palamidessi English
2.4 Programmation fonctionnelle et systèmes de types
Functional programming and type systems
48 6 1-2 20 2.5 D. Rémy French by default Yes
2.5.1 (S)Démonstration automatique
Automated deduction
243 2 8 3 R. Treinen French by default
2.6Interprétation abstraite: application à la vérification et à l'analyse statique
Abstract interpretation: application to verification and static analysis
48 6 1-2 16 3 A. Miné English upon request
2.7.1Fondements des systèmes de preuves
Foundations of proof systems
243 1 8 3 G. Dowek English upon request
2.7.2Assistants de preuves
Proof assistants
24 3 2 8 3 B. Barras French by default
2.8.1Théorie non-séquentielle des systèmes distribués
Non-sequential theory of distributed systems
243 1 10 2.5 B. Bollig1/2 English upon request
1/2 French upon request
2.8.2Fondements des systèmes temps-réel et hybrides
Foundations of real time and hybrid systems
243 1 10 2.5 P. BouyerFrench by default
2.9.1Beaux préordres et algorithmes
Well-Quasi-Orders for Algorithms
243 1 8 3 A. FinkelEnglish upon request
2.9.2Vérification algorithmique des programmes
Algorithmic verification of programs
243 2 8 3 A. Bouajjani English upon request
2.10 Aspects algorithmiques de la combinatoire
Algorithmic aspects of combinatorics
486 1-2 20 2.5 G. Schaeffer French
2.11 (S)Complexité randomisée (long)
Randomness in complexity (long)
4861-2 16 3 A. Rosén English Yes
2.11.1Algorithmes d’approximation et Algorithmique moléculaire
Approximation algorithms and molecular algorithms
2431 8 3 N. Schabanel English upon request
2.11.2 (S)Complexité randomisée (court)
Randomness in complexity (short)
2431 8 3 A. Rosén English
2.12.1 Techniques en cryptographie et cryptoanalyse
Techniques in cryptography and cryptanalysis
2432 16 1.5 M. Abdalla English
2.12.2Algorithmes arithmétiques pour la cryptologie
Arithmetic algorithms for cryptology
243 2 16 3F. Morain 1/3 English by default
2/3 English upon request
2.13.1Systèmes polynomiaux, calcul formel et applications
Polynomial systems, computer algebra and applications
243 2 8 3 J.-C. Faugère English upon request
2.13.2Codes correcteurs d'erreurs et applications à la cryptographie
Error correcting codes and applications to cryptography
243 1-2 16 1.5 A. Canteaut French by default
2.14.1Analyse géométrique des données
Computational geometry learning
243 1 10 2.5 J.-D. Boissonnat English upon request
2.15Analyse d'algorithmes
Analysis of algorithms
4861-2 16 3 C. Nicaud French
2.16Modélisation par automates finis
Finite automata modelling
486 1-2 16 3 T. Colcombet English upon request
2.17.1Fondements sur la modélisation des réseaux
Foundations of network models
243 2 10 2.5 J. Mairesse English upon request
2.18.1Algorithmique distribuée pour les réseaux
Distributed algorithms on networks
2431-2 16 1.5 P. Fraigniaud 1/2 French by default 1/2 English
2.18.2Algorithmique distribuée avec mémoire partagée
Distributed algorithms on shared memory
2431 8 3 C. Delporte English and French
2.19 Programmation biochimique
Biochemical Programming
243 2 10 3 F. Fages French by default Yes
2.20.1Techniques de théorie des jeux en informatique
Game theory techniques in computer science
243 1 8 3 W. Zielonka French
2.20.2 Fondations mathématiques de la théorie des automates
Mathematical foundations of automata theory
243 1-2 16 1.5 J.-E. Pin English upon request
2.22Algorithmes efficaces en calcul formel
Efficient algorithms in computer algebra
4861-2 16 3 B. Salvy French by default Yes
2.23.1Programmation des systèmes synchrones
Programming of synchronous systems
243 1 8 3 M. Pouzet English upon request
2.24.1Optimisation
Optimization
243 1 10 2.5 S. Angelopoulos English
2.24.2Résolution de problèmes d'optimisation avec heuristiques de recherche
Solving optimization problems with search heuristics
243 2 10 2.5 C. Doerr English
2.26.1 (S) Logique, complexité descriptive et théorie des bases de données
Logic, descriptive complexity and database theory
24 3 2 8 3 L. Segoufin French by default
2.26.2 Gestion de données du web
Web data management
24 3 2 8 3 P. Senellart English upon request
2.27.1Structures informatiques et logiques pour la modélisation linguistique
Computational structures and logics for natural language modelling
243 1 8 3 S. Schmitz English upon request
2.29.1Algorithmique des graphes
Graph algorithms
243 1 8 3 R. Naserasr French by default
2.29.2Fouille de graphes
Graph mining
243 2 8 3 M. Sozio English
2.30Protocoles cryptographiques : preuves formelles et calculatoires
Cryptographic protocols: computational and symbolic proofs
486 1-2 16 3 B. Blanchet English upon request Yes
2.33.1 (S) Théorie des calculs
Theory of computations
24 3 1 10 2.5 B. Charron-Bost English upon request
2.33.2 (S) Complexité de circuits
Circuit complexity
24 3 1 10 2.5 S. Perifel English upon request
2.33.3 Calculs sur les réels: modèles, calculabilité, complexité
Computations over the reals: models, computability, complexity
24 3 1 10 2.5 O. Bournez English upon request
2.34.1 Informatique quantique
Quantum information
24 3 1 8 3 S. Laplante English upon request
2.34.2 Informatique quantique et cryptographie
Quantum information and cryptography
24 3 2 8 3 A. Chailloux English upon request
2.35.1 (S) Programmation par contraintes
Constraint programming
24 3 1 8 3 S. Soliman French by default
2.36.1 Preuve de programmes
Proofs of programs
24 3 2 8 3 C. Marché English upon request
2.37.1Sémantique, langages et algorithmes pour la programmation multicore
Semantics, languages and algorithms for multicore programming
24 3 2 8 3 A. Cohen English upon request
2.38.1 Algorithmique et combinatoire des graphes géométriques
Algorithms and combinatorics for geometric graphs
24 3 1 8 3 V. Pilaud French by default
2.39 Informatique graphique et visualisation scientifique
Computer Graphics and Visualization
24 3 1-2 8 3 J. Tierny English upon request

Semantics of the teaching languages annotations:

  • “English upon request” means that the module will be taught in French, unless one non-French speaking student requests English
  • “French by Default” means that the module is taught in French, unless at least one non-French speaking student requests English and no French speaking students requests French
  • “English by Default” is obtained by transposing “French” and “English” in the above case.
  • “English” (resp. “French”) means that the module will be taught in English (resp. French) independently of the students attending. Most of the time, however, some of the teaching material is available in French (resp. English)

For a more detailed information on the teaching language of each module, as well as concerning the language of the exams, please look at the web page of the module.

The previous years

 
Universités partenaires Université Paris-Diderot
Université Paris-Saclay
ENS Cachan École polytechnique Télécom ParisTech
ENS
Établissements associés Université Pierre-et-Marie-Curie CNRS INRIA CEA