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

emploidutemps19 [2019/08/02 14:05]
carton
emploidutemps19 [2019/09/25 17:01] (current)
carton [2019-2020 Agenda]
Line 54: Line 54:
   * Aug. 20: internship reports upload (on the pedagogical server)   * Aug. 20: internship reports upload (on the pedagogical server)
  
-===2018-2019 SCHEDULE M2-MPRI COURSES ===+===2019-2020 SCHEDULE M2-MPRI COURSES ===
  
 All courses take place in rooms located in building Sophie Germain. All courses take place in rooms located in building Sophie Germain.
Line 76: Line 76:
 | Tuesday  \\  12h45|2_3_2: Foundations of privacy \\ 2_16: Finite automata modelling \\ 2_34_2: Quantum information and cryptography|1014 \\ 1013 \\ 1014|1 \\ 1-2 \\ 2| \\  \\ | | Tuesday  \\  12h45|2_3_2: Foundations of privacy \\ 2_16: Finite automata modelling \\ 2_34_2: Quantum information and cryptography|1014 \\ 1013 \\ 1014|1 \\ 1-2 \\ 2| \\  \\ |
 | Tuesday  \\  16h15|2_12_1: Techniques in cryptographic and cryptoanalysis \\ 2_12_2: Arithmetic algorithms for cryptology \\ 2_20_1: Game theory techniques in computer science|1013 \\ 1013 \\ 1014|1-2 \\ 1-2 \\ 1|second half of slot \\ first half of slot \\ | | Tuesday  \\  16h15|2_12_1: Techniques in cryptographic and cryptoanalysis \\ 2_12_2: Arithmetic algorithms for cryptology \\ 2_20_1: Game theory techniques in computer science|1013 \\ 1013 \\ 1014|1-2 \\ 1-2 \\ 1|second half of slot \\ first half of slot \\ |
-| Wednesday  \\  8h45|2_8_1: Non-sequential theory of distributed systems \\ 2_11_1: Approximation algorithms and Molecular programming \\ 2_24_2 Optimization and Search Heuristics|1013 \\ 1014 \\ 1014|1-2 \\ 1 \\ 2|first half of slot \\  \\ |+| Wednesday  \\  8h45|2_8_1: Non-sequential theory of distributed systems \\ 2_11_1: Approximation algorithms and Molecular programming \\ 2_24_2 Optimization and Search Heuristics|1013 \\ 1014 \\ 1014|1-2 \\ 1 \\ 2|second half of slot \\  \\ |
 | Wednesday  \\  12h45|2_6: Abstract interpretation: application to verification and static analysis \\ 2_26_2: Web data management \\ 2_38_1: Algorithms and combinatorics for geometric graphs|1014 \\ 1013 \\ 1013|1-2 \\ 2 \\ 1| \\  \\ | | Wednesday  \\  12h45|2_6: Abstract interpretation: application to verification and static analysis \\ 2_26_2: Web data management \\ 2_38_1: Algorithms and combinatorics for geometric graphs|1014 \\ 1013 \\ 1013|1-2 \\ 2 \\ 1| \\  \\ |
 | Wednesday  \\  16h15|2_15: Analysis of algorithms \\ 2_30: Cryptographic protocols: formal and computational proofs|1013 \\ 1014|1-2 \\ 1-2| \\ | | Wednesday  \\  16h15|2_15: Analysis of algorithms \\ 2_30: Cryptographic protocols: formal and computational proofs|1013 \\ 1014|1-2 \\ 1-2| \\ |
 
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