Responsible of the course: Pierre Fraigniaud (Directeur de Recherche CNRS, IRIF, Université Paris Cité)

Schedule: Unless specified otherwise, during the period from Sept. 13, 2023, to Feb. 21, 2024, the lectures will take place from 10:30 to 12:00 every Wednesday morning, room 1002 of Building Sophie Germain (Université Paris Cité).

• Pierre Fraigniaud (Directeur de Recherche CNRS), IRIF, Université Paris Cité
• Mikaël Rabie (Maitre de Conférence), IRIF, Université Paris Cité

Distributed Computing is dedicated to the design and analysis of algorithms performed by a set of autonomous computing entities whose objective is the realization of a common task, in absence of any coordinator, like in, e.g., Internet, P2P systems, cloud computing, wireless networks, social networks, insect colonies, school of fish, etc., and any decentralized system in general.

This course focusses on distributed computing in networks, in which the computing entities have to cope with uncertainty caused by spatial constraints. The typical problems to be solved in this context are graph problems, such as coloring, construction of a maximal independent set (MIS), construction of a minimum-weight spanning tree (MST), etc.

The design and analysis of distributed algorithms in networks is tightly connected to the following fields: graph theory, deterministic and randomized algorithms, communication complexity, interactive proofs, etc. The course may even provide examples of connections with algebraic topology, zero-knowledge proofs, and quantum computing.

Prequisite

This course does not require specific prerequisite, other than basic knowledge in algorithm design and analysis, probability, and graph theory.

Below are links to teaching material from 2022-2023, and previous years. The slides of the 2023-2024 lectures will be posted online.

Lecture notes and slides MPRI P. Fraigniaud

Slides MPRI M. Rabie

Slides MPRI A. Paz

Recommended books

Juho Hirvonen and Jukka Suomela: Distributed Algorithms 2020, Aalto University, Finland

David Peleg. Distributed Computing: A Locality-Sensitive Approach. SIAM, Philadelphia, PA (2000)

Leonid Barenboim, Michael Elkin. Distributed Graph Coloring: Fundamentals and Recent Developments. Synthesis Lectures on Distributed Computing Theory, Morgan and Claypool Publishers (2013)

• Partial Exam: Wednesday, November 29, 2003, 10h30-12h00, usual room.
• Final Exam: To be announced.

Rules for the partial and final exams:

• Allowed:
  • all handwritten notes related to the course,
  • copies of slides, exercises and solutions,
• Not allowed: electronic devices like computers, tablets, cell-phones, etc.
• Please bring your own A4 size paper.

• Carole Delporte (Professeur, IRIF, Université Paris Cité)
• Hugues Fauconnier (Professeur, IRIF, Université de Paris)
• Pierre Fraigniaud (Directeur de Recherche CNRS, IRIF, Université Paris Cité)
• Amos Korman (Directeur de Recherche CNRS, IRIF, Université Paris Cité)
• Ami Paz (Chargé de Recherche CNRS, LISN, Université de Paris Saclay)
• Mikaël Rabie (Maitre de Conférence, IRIF, Université Paris Cité)
• Laurent Viennot (Directeur de Recherche INRIA, IRIF, Université Paris Cité)