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:cours2 [2018/07/10 15:27]
carton
cours:cours2 [2019/07/18 21:06] (current)
carton
Line 37: Line 37:
 |**[[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-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.3.1]]** | Concurrence \\ Concurrency| 24 | 3 | 2 | 8 | 3 |E. Haucourt| French by default |  |
-|**[[C-2-3-2|2.3.2]]**(S)| Fondements de la confidentialité des données\\ Foundations of privacy| 24 | 3 | 2 | 8 | 3 |C. Palamidessi| English|  |+|**[[C-2-3-2|2.3.2]]**| Fondements de la confidentialité des données\\ Foundations of privacy| 24 | 3 | 2 | 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 | Yes | |**[[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 | Yes |
 |**[[C-2-5|2.5.1 (S)]]**|Démonstration automatique \\ Automated deduction |24|3| 2| 8 | 3| R. Treinen |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 |
Line 50: Line 50:
 |**[[C-2-11|2.11]]** (S)|Complexité randomisée (long) \\ Randomness in complexity (long)|48|6|1-2 | 16 | 3 | A. Rosén | English | Yes| |**[[C-2-11|2.11]]** (S)|Complexité randomisée (long) \\ Randomness in complexity (long)|48|6|1-2 | 16 | 3 | A. Rosén | English | Yes|
 |**[[C-2-11-1|2.11.1]]**|Algorithmes d’approximation et Algorithmique moléculaire \\ Approximation algorithms and molecular algorithms |24|3|1 | 8 | 3 |N. Schabanel | English upon request | |**[[C-2-11-1|2.11.1]]**|Algorithmes d’approximation et Algorithmique moléculaire \\ Approximation algorithms and molecular algorithms |24|3|1 | 8 | 3 |N. Schabanel | English upon request |
-|**[[C-2-11-2|2.11.2]]** (S)|Complexité randomisée (court) \\ Randomness in complexity (short)|24|3|1 | 8 | 3 |ARosén| English |+|**[[C-2-11-2|2.11.2]]** |Complexité randomisée (court) \\ Randomness in complexity (short)|24|3|1 | 8 | 3 |FMagniez| English |
 |**[[C-2-12-1|2.12.1]]**| Techniques en cryptographie et cryptoanalyse \\ Techniques in cryptography and cryptanalysis|24|3|2 | 16 | 1.5 |M. Abdalla| English  | |**[[C-2-12-1|2.12.1]]**| Techniques en cryptographie et cryptoanalyse \\ Techniques in cryptography and cryptanalysis|24|3|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| 2| 16 | 3|F. Morain| 1/3 English by default \\ 2/3 English upon request | |**[[C-2-12-2|2.12.2]]**|Algorithmes arithmétiques pour la cryptologie \\ Arithmetic algorithms for cryptology |24|3| 2| 16 | 3|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-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-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-14-1|2.14.1]]**|Analyse géométrique des données \\ Computational geometry learning|24|3| 1 | 10 | 2.5 |MGlisse |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-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-16|2.16]]**|Modélisation par automates finis \\ Finite automata modelling |48|6| 1-2| 16 | 3 |T. Colcombet| English upon request |
Line 63: Line 63:
 |**[[C-2-19|2.19]]**| Programmation biochimique  \\ Biochemical Programming|24|3| 2 | 10 | 3 |F. Fages| French by default | Yes | |**[[C-2-19|2.19]]**| Programmation biochimique  \\ Biochemical Programming|24|3| 2 | 10 | 3 |F. Fages| French by default | Yes |
 |**[[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-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-20-2|2.20.2]]** | Dynamique symbolique \\ Symbolic dynamics|24|3| 1-2| 16 | 1.5 | VBerthé | 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-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]]**|Programmation des systèmes synchrones \\ Programming of synchronous systems|24|3| 1 | 8 | 3 |M. Pouzet| English upon request |  |**[[C-2-23-1|2.23.1]]**|Programmation des systèmes synchrones \\ Programming of synchronous systems|24|3| 1 | 8 | 3 |M. Pouzet| English upon request | 
Line 74: Line 74:
 |**[[C-2-29-2|2.29.2]]**|Fouille de graphes \\ Graph mining |24|3| 2| 8 | 3 |M. Sozio| English | |**[[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-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]]** (S)Théorie des calculs \\ Theory of computations | 24 |3 | 1  | 10 | 2.5 |B. Charron-Bost| English upon request |+|**[[C-2-33-1|2.33.1]]** | Consensus in multi-agent systems \\ Problèmes de consensus dans les systèmes multi-agents | 24 |3 | 1  | 10 | 2.5 |B. Charron-Bost| English upon request |
 |**[[C-2-33-2|2.33.2]]** (S)| Complexité de circuits \\ Circuit complexity | 24 |3 | 1  | 10 | 2.5 |S. Perifel| English upon request | |**[[C-2-33-2|2.33.2]]** (S)| Complexité de circuits \\ Circuit complexity | 24 |3 | 1  | 10 | 2.5 |S. Perifel| English upon request |
-|**[[C-2-33-3|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 |+|**[[C-2-33-3|2.33.3]]** (S)| 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 |
 |**[[C-2-34-1|2.34.1]]**| Informatique quantique \\ Quantum information | 24 | 3 | 1 | 8 | 3 |S.  Laplante| English upon request |  |**[[C-2-34-1|2.34.1]]**| Informatique quantique \\ Quantum information | 24 | 3 | 1 | 8 | 3 |S.  Laplante| English upon request | 
 |**[[C-2-34-2|2.34.2]]**| Informatique quantique et cryptographie \\ Quantum information and cryptography | 24 | 3 | 2 | 8 | 3 |A. Chailloux| English upon request |  |**[[C-2-34-2|2.34.2]]**| Informatique quantique et cryptographie \\ Quantum information and cryptography | 24 | 3 | 2 | 8 | 3 |A. Chailloux| 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-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-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 |ACohen| English upon request |+|**[[C-2-37-1|2.37.1]]**|Progammation des machines multicoeurs à mémoire partagée \\ Programming shared memory multicore machines| 24| 3 | 2| 8 | 3 |LMaranget| 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 |V. Pilaud | French by default|  |**[[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 |V. Pilaud | French by default| 
 |**[[C-2-39|2.39]]**| Informatique graphique et visualisation scientifique \\ Computer Graphics and Visualization| 24 | 3 | 1-2 | 8 | 3 |J. Tierny| English upon request| |**[[C-2-39|2.39]]**| Informatique graphique et visualisation scientifique \\ Computer Graphics and Visualization| 24 | 3 | 1-2 | 8 | 3 |J. Tierny| English upon request|
 
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