MPRI 23-24
Lecture Slides
Lecture Slides
Slides for my lectures in the Distributed Algorithms on Networks course in the Parisian Master of Research in Computer Science (MPRI), and in the advance topics course in Paris-Scaly, 2023-2024
The CLIQUE model
The CLIQUE model
Communication Complexity
Communication Complexity
CONGEST Lower Bounds for MST and Subgraph Connectivity
CONGEST Lower Bounds for MST and Subgraph Connectivity
Smoothed Analysis of Dynamic Networks
Smoothed Analysis of Dynamic Networks