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

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

cours:2016-2017-cours2 [2017/07/24 13:48] (current)
carton created
Line 1: Line 1:
 +==== List of level 2 modules  ====
 +Courses marked with a (S) are suspended in the academic year 2016-2017 
  
 +
 +|**Module** |**Title** |**Nb. H** |**ECTS** |**Period(s)** |** Nb. Week **|** H/Week **|**Person(s) in charge** |**Teaching Language**|**Breakable**|
 +|**[[C-2-1|2.1]]**| Logique linéaire et paradigmes logiques du calcul \\ Linear logic and logical paradigms of computation | 48 | 6 | 1-2 | 16 |3 |R. Di Cosmo| 3/4 French by default, 1/4 English | |
 +|**[[C-2-2|2.2]]**|Modè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ès|English upon request | |
 +|**[[C-2-3|2.3.1]]**| Concurrence \\ Concurrency| 24 | 3 | 2 | 8 | 3 |E. Haucourt| French by default |  |
 +|**[[C-2-3-2|2.3.2]]**| Fondements de la confidentialité des données\\ Foundations of privacy| 24 | 3 | 1 | 8 | 3 |C. Palamidessi| English|  |
 +|**[[C-2-4-2|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 |
 +|**[[C-2-5|2.5.1 (S)]]**|Démonstration automatique \\ Automated deduction |24|3| 2| 8 | 3| R. Treinen |French by default |
 +|**[[C-2-6|2.6]]**|Interpré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 |
 +|**[[C-2-7-1|2.7.1]]**|Fondements des systèmes de preuves \\ Foundations of proof systems|24|3| 1 | 8 | 3 |G. Dowek |English upon request |
 +|**[[C-2-7-2|2.7.2]]**|Assistants de preuves \\ Proof assistants| 24 | 3 |2  | 8 | 3 |B. Barras | French by default |
 +|**[[C-2-8-1|2.8.1]]**|Théorie non-séquentielle des systèmes distribués \\ Non-sequential theory of distributed systems|24|3| 1 | 10 | 2.5 |B. Bollig|1/2 English upon request \\ 1/2 French upon request |
 +|**[[C-2-8-2|2.8.2]]**|Fondements des systèmes temps-réel et hybrides \\ Foundations of real time and hybrid systems |24|3| 1 | 10 | 2.5 |P. Bouyer|French by default |
 +|**[[C-2-9-1|2.9.1 (S)]]**|Fondements mathématiques de la théorie des systèmes infinis\\ Mathematical foundations of the theory of infinite transition systems |24|3| 1  | 8 | 3 |A. Finkel|French by default|
 +|**[[C-2-9-2|2.9.2]]**|Vérification algorithmique des programmes\\ Algorithmic verification of programs |24|3| 2  | 8 | 3 |A. Bouajjani | English upon request |
 +|**[[C-2-10|2.10]]** |Aspects algorithmiques de la combinatoire \\ Algorithmic aspects of combinatorics|48|6| 1-2 | 20 | 2.5 |G. Schaeffer| French |
 +|**[[C-2-11|2.11 (S)]]**|Complexité randomisée (long) \\ Randomness in complexity (long)|48|6|1-2 | 16 | 3 |F. Magniez | English | Yes|
 +|**[[C-2-11-1|2.11.1]]**|Algorithmes probabilistes \\ Randomized algorithms |24|3|1 | 8 | 3 |N. Schabanel | English upon request |
 +|**[[C-2-11-2|2.11.2]]**|Complexité randomisée (court) \\ Randomness in complexity (short)|24|3|1 | 8 | 3 |F. Magniez| English |
 +|**[[C-2-12-1|2.12.1]]**| Techniques en cryptographie et cryptoanalyse \\ Techniques in cryptography and cryptanalysis|24|3|1-2 | 16 | 1.5 |M. Abdalla| English  |
 +|**[[C-2-12-2|2.12.2]]**|Algorithmes arithmétiques pour la cryptologie \\ Arithmetic algorithms for cryptology |24|3| 1-2| 16 | 1.5 |F. Morain| 1/3 English by default \\ 2/3 English upon request |
 +|**[[C-2-13-1|2.13.1]]**|Systèmes polynomiaux, calcul formel et applications  \\  Polynomial systems, computer algebra and applications|24|3| 2| 8 | 3 |J.-C. Faugère| English upon request |
 +|**[[C-2-13-2|2.13.2]]**|Codes correcteurs d'erreurs et applications à la cryptographie \\ Error correcting codes and applications to cryptography|24|3| 1-2 | 16 | 1.5 | A. Canteaut| French by default  |
 +|**[[C-2-14-1|2.14.1]]**|Analyse géométrique des données \\ Computational geometry learning|24|3| 1 | 10 | 2.5 |J.-D. Boissonnat |English upon request|
 +|**[[C-2-15|2.15]]**|Analyse d'algorithmes \\ Analysis of algorithms|48|6|1-2  | 16 | 3 |C. Nicaud| French |
 +|**[[C-2-16|2.16]]**|Modélisation par automates finis \\ Finite automata modelling |48|6| 1-2| 16 | 3 |T. Colcombet| English upon request |
 +|**[[C-2-17-1|2.17.1]]**|Fondements sur la modélisation des réseaux \\ Foundations of network models|24|3| 2 | 10 | 2.5 |J. Mairesse| English upon request | 
 +|**[[C-2-18-1|2.18.1]]**|Algorithmique distribuée pour les réseaux \\ Distributed algorithms on networks|24|3|1-2 | 16 | 1.5 |P. Fraigniaud| 1/2 French by default  1/2 English |
 +|**[[C-2-18-2|2.18.2]]**|Algorithmique distribuée avec mémoire partagée \\ Distributed algorithms on shared memory |24|3|1 | 8 | 3 |C. Delporte| English and French |
 +|**[[C-2-19|2.19]]**|Méthodes informatiques pour la biologie systémique et synthétique  \\ Computational methods for systems and synthetic biology|48|6| 1-2 | 16 | 3 |F. Fages| French by default |
 +|**[[C-2-20-1|2.20.1]]**|Techniques de théorie des jeux en informatique \\ Game theory techniques in computer science|24|3| 1  | 8 | 3 |W. Zielonka| French  |
 +|**[[C-2-20-2|2.20.2]]**|Fondations mathématiques de la théorie des automates \\ Mathematical foundations of automata theory|24|3| 1-2| 16 | 1.5 | J.-E. Pin | English upon request |
 +|**[[C-2-22|2.22]]**|Algorithmes efficaces en calcul formel \\ Efficient algorithms in computer algebra|48|6|1-2 | 16 | 3 |B. Salvy| French by default | Yes |
 +|**[[C-2-23-1|2.23.1]]**|Systèmes synchrones \\ Synchronous systems|24|3| 1 | 8 | 3 |M. Pouzet| English upon request | 
 +|**[[C-2-24-1|2.24.1]]**|Optimisation \\ Optimization |24|3| 1 | 10 | 2.5 |S. Angelopoulos| English  |
 +|**[[C-2-24-2|2.24.2]]**|Résolution de problèmes d'optimisation avec heuristiques de recherche \\ Solving optimization problems with search heuristics |24|3| 2 | 10 | 2.5 |C. Doerr| English  |
 +|**[[C-2-26-1|2.26.1]]** | 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 |
 +|**[[C-2-26-2|2.26.2]]** | Gestion de données du web \\ Web data management | 24 | 3 | 2 | 8 | 3 |S. Abiteboul| English upon request |
 +|**[[C-2-27-1|2.27.1]]**|Structures informatiques et logiques pour la modélisation linguistique \\ Computational structures and logics for natural language modelling |24|3| 1 | 8 | 3 |S. Schmitz| English upon request |
 +|**[[C-2-29-1|2.29.1]]**|Algorithmique des graphes \\ Graph algorithms |24|3| 1| 8 | 3 |M. Habib| French by default |
 +|**[[C-2-29-2|2.29.2]]**|Fouille de graphes \\ Graph mining |24|3| 2| 8 | 3 |M. Sozio| English |
 +|**[[C-2-30|2.30]]**|Protocoles cryptographiques : preuves formelles et calculatoires  \\ Cryptographic protocols: computational and symbolic proofs |48|6| 1-2 | 16 | 3 |B. Blanchet| English upon request | Yes |
 +|**[[C-2-33-1|2.33.1]]** | Théorie des calculs \\ Theory of computations | 24 |3 | 1  | 10 | 2.5 |B. Charron-Bost| English upon request |
 +|**[[C-2-34-1|2.34.1]]**| Informatique quantique et applications\\ Quantum information and applications | 24 | 3 | 2 | 8 | 3 |S.  Laplante| English upon request | 
 +|**[[C-2-35-1|2.35.1 (S)]]**| Programmation par contraintes \\ Constraint programming | 24 | 3 | 1 | 8 | 3 |S. Soliman | French by default |
 +|**[[C-2-36-1|2.36.1]]**| Preuve de programmes\\ Proofs of programs | 24 | 3 | 2 | 8 | 3 |C. Marché | English upon request |
 +|**[[C-2-37-1|2.37.1]]**|Sé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 |
 +|**[[C-2-38-1|2.38.1]]**| Algorithmique et combinatoire des graphes géométriques \\ Algorithms and combinatorics for geometric graphs| 24 | 3 | 1 | 8 | 3 |E. Colin de Verdiere | French by default| 
 +
 +
 +
 +=== 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 following table summarizes the duration of each module and the weekly teaching load.
 +The modules lasting for 8 or 16 weeks may organize optional exercise classes before the exam.
 +
 +|**Module**|**Nb.Weeks** |**Nb hours each week**|                           |**Module**|**Nb.Weeks** |**Nb hours each week**|
 +|**[[C-2-1|2.1]]** | 16 | 3 | |**[[C-2-18-2|2.18.2]]** | 8 | 3 |
 +|**[[C-2-2|2.2]]** | 16 | 3 | |**[[C-2-18-3|2.18.3]]** | 8 | 3 |
 +|**[[C-2-3|2.3]]** | 20 | 2.5 | |**[[C-2-19|2.19]]** | 16 | 3|
 +|**[[C-2-4-2|2.4]]** | 20 | 2.5 |  |**[[C-2-20-1|2.20.1]]** | 10 | 2.5 |
 +|**[[C-2-5|2.5.1]]** | 8 | 3 |  |**[[C-2-20-2|2.20.2]]** | 16 | 1.5 |
 +|**[[C-2-6|2.6]]** | 16 | 3 | |**[[C-2-22|2.22]]** | 16 | 3 |
 +|**[[C-2-7-1|2.7.1]]** | 16  | 1.5 | |**[[C-2-23-1|2.23.1]]** | 8 | 3 |
 +|**[[C-2-7-2|2.7.2]]** | 8 | 3 | |**[[C-2-24-1|2.24.1]]** | 10 | 2.5 |
 +|**[[C-2-8|2.8]]** | 16 | 3 |  |**[[C-2-26-1|2.26.1]]** | 8 | 3 |
 +|**[[C-2-9-1|2.9.1]]** | 8 | 3 | |**[[C-2-26-2|2.26.2]]** | 8 | 3 |
 +|**[[C-2-9-2|2.9.2]]** | 8 | 3 | |**[[C-2-27-1|2.27.1]]** | 8 | 3 |
 +|**[[C-2-10|2.10]]** | 20 | 2.5 | |**[[C-2-29-1|2.29.1]]** | 16 | 1.5 |
 +|**[[C-2-11-2|2.11.2]]** | 8 | 3 |      |**[[C-2-30|2.30]]** | 16 | 3 |
 +|**[[C-2-12-1|2.12.1]]** | 16 | 1.5 | |**[[C-2-33-1|2.33.1]]** | 8 | 3 |
 +|**[[C-2-12-2|2.12.2]]** | 16 | 1.5 | |**[[C-2-34-1|2.34.1]]** | 8 | 3 |
 +|**[[C-2-13-1|2.13.1]]** | 16 | 1.5 | |**[[C-2-35-1|2.35.1]]** | 8 | 3|
 +|**[[C-2-13-2|2.13.2]]** | 16 | 1.5 | |**[[C-2-36-1|2.36.1]]** | 8 | 3|
 +|**[[C-2-14-1|2.14.1]]** | 10 | 2.5 | |**[[C-2-37-1|2.37.1]]** | 8 | 3|
 +|**[[C-2-15|2.15]]** | 16 | 3 |  |**[[C-2-38-1|2.38.1]]** | 8 | 3 |
 +|**[[C-2-16|2.16]]** | 16 | 3 | 
 +|**[[C-2-17-1|2.17.1]]** | 10 | 2.5 |
 +|**[[C-2-18-1|2.18.1]]** | 16 | 1.5 |
 +**/
 +
 +===Themes covered by the level 2 modules===
 +See [[themes2013|here]] (last updated in 2013)
 +
 +
 +=== The previous years ===
 +   * [[2015-2016-cours2|2015-2016]]
 +   * [[2014-2015-cours2|2014-2015]]
 +   * [[2013-2014-cours2|2013-2014]]
 +   * [[2012-2013-cours2|2012-2013]]
 +   * [[2011-2012-cours2|2011-2012]]
 + 
 +/**   
 +   * [[2009-2010-cours2|Année 2009-2010]]
 +   * [[2008-2009-cours2|Année 2008-2009]]
 +   * [[2007-2008-cours2|Année 2007-2008]]
 +   * [[2006-2007-cours2|Année 2006-2007]]
 +   * [[2005-2006-cours2|Année 2005-2006]]
 +   * [[2004-2005-cours2|Année 2004-2005]] **/
 +
 +
 +/** [[sandbox|sandbox]] **/
 
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