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:c-2-18-1 [2019/02/03 17:17]
fraigniaud [Exams]
cours:c-2-18-1 [2019/09/19 15:44] (current)
fraigniaud [Teaching material]
Line 3: Line 3:
  
 Responsible of the course: [[http://www.liafa.univ-paris-diderot.fr/~pierref/|Pierre Fraigniaud]] (Directeur de Recherche CNRS, [[http://www.IRIF.fr/~pierref/|IRIF]], Université Paris Diderot) Responsible of the course: [[http://www.liafa.univ-paris-diderot.fr/~pierref/|Pierre Fraigniaud]] (Directeur de Recherche CNRS, [[http://www.IRIF.fr/~pierref/|IRIF]], Université Paris Diderot)
-==== Lecturers Year 2018-2019 ====+==== Lecturers Year 2019-2020 ====
  
   * [[http://www.liafa.univ-paris-diderot.fr/~pierref/|Pierre Fraigniaud]] (Directeur de Recherche CNRS), [[http://www.liafa.univ-paris-diderot.fr/|LIAFA]], Université Paris Diderot   * [[http://www.liafa.univ-paris-diderot.fr/~pierref/|Pierre Fraigniaud]] (Directeur de Recherche CNRS), [[http://www.liafa.univ-paris-diderot.fr/|LIAFA]], Université Paris Diderot
-  * [[http://www.liafa.univ-paris-diderot.fr/~kosowski/|Adrian Kosowski]] (Chargé de Recherche INRIA), [[http://www.inria.fr/en/teams/gang |INRIA]], LIAFA, Université Paris Diderot 
   * [[http://www.mpi-inf.mpg.de/~doerr/|Benjamin Doerr]] (Professeur, [[http://www.lix.polytechnique.fr|LIX]], Ecole Polytechnique)   * [[http://www.mpi-inf.mpg.de/~doerr/|Benjamin Doerr]] (Professeur, [[http://www.lix.polytechnique.fr|LIX]], Ecole Polytechnique)
  
Line 20: Line 19:
 The course will be decomposed into three successive parts:  The course will be decomposed into three successive parts: 
  
-  * Part 1: Fundaments of local computing in networks;  +  * Part 1: Fundaments of local computing in networks: solving graph problems locally;  
-  * Part 2: Analysis of information spreading in networks;  +  * Part 2: Distributed graph algorithms under communication constraints;  
-  * Part 3: Analysis of dynamic systems.  +  * Part 3: Analysis of information spreading in networks; 
  
 == Courses in direct connection with this course == == Courses in direct connection with this course ==
Line 30: Line 29:
   * [[cours:c-2-29-1|2.29.1 Graph algorithms]]   * [[cours:c-2-29-1|2.29.1 Graph algorithms]]
   * [[cours:c-2-33-1|2.33.1 Computation theory]]   * [[cours:c-2-33-1|2.33.1 Computation theory]]
- 
 ==== Exams ==== ==== Exams ====
  
-  * Partial Exam: November 292018, 9h-12h, usual room (1003)+  * Partial Exam: November 212019, 9h-12h, usual room. 
-  * Final Exam: March 7, 2019, usual room.+  * Final Exam: TBA.
  
 **Rules for the partial and final exams:** **Rules for the partial and final exams:**
Line 48: Line 46:
  
 This course does not require specific prerequisite, other than basic knowledge in algorithm and in probability.  This course does not require specific prerequisite, other than basic knowledge in algorithm and in probability. 
-==== Recommended books ===+==== Teaching material === 
 + 
 +[[https://www.irif.fr/users/pierref/mpri|Lecture notes and slides for Parts 1 and 2]] 
 + 
 +** Recommended books **
  
 David Peleg. //Distributed Computing: A Locality-Sensitive Approach//. SIAM, Philadelphia, PA (2000) David Peleg. //Distributed Computing: A Locality-Sensitive Approach//. SIAM, Philadelphia, PA (2000)
 
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