Schedule

Day 1 (4th November)

Session 1 (9:30 - 10:30)

• Invited Talk: Survey of the Distributed Lovasz Local Lemma [Slides]

Session 2 (11:00 - 12:00)

• Topological Perspective on Local Computing in Networks [Slides]

Session 3 (14:00 - 15:30)

• Dynamic Algorithms for the Massively Parallel Computation Model [Slides]

• Distributed Algorithms for LP-Type Problems [Slides]

• Recent Developments on Distributed Min-Cut Problem [Slides]

Session 4 (16:00 - 17:00)

• Quantum Distributed Graph Algorithms

• Optimal Distributed Covering Algorithms [Slides]

Free Discussion Time (17:00 - 18:00)

Day 2 (5th November)

Session 1 (9:00 - 10:00)

• Invited Talk: Distributed derandomization via network decomposition

Session 2 (10:30 - 12:00)

• Distributed Computation of MIS in Hypergraphs [Slides]

• Distributed expander decomposition and its applications [Slides]

• Leader Election in Population Protocols [Slides]

Session 3 (13:30 - 15:00)

• An Automatic Speedup Technique for the LOCAL Model [Slides]

• The landscape of distributed time complexity [Slides]

• Trade-offs in Distributed Interactive Proofs [Slides]

Session 4 (16:00 - 17:00)

• Tutorial on Distributed Quantum Computing [Slides]

Free Discussion Time (17:00 - 18:00)

Day 3 (6th November)

Session 1 (9:00 - 10:00)

• Invited Talk: Lower bounds for maximal matchings and maximal independent sets [Slides]

Session 2 (10:30 - 12:00)

• On the swap game with local information [Slides]

• Distance-2 Coloring in CONGEST [Slides]

• Distributed Algorithms below the Sequential Greedy Regime

Excursion (1:30 - 20:45)

Day 4 (7th November)

Session 1 (9:00 - 10:00)

• Invited Talk: Deterministic Distributed Coloring (Through Recursive List Coloring)

Session 2 (10:30 - 12:00)

• Parameterized Distributed Algorithms

• Distributed Algorithms for MCMC Sampling [Slides]

• Distributed Uniformity Testing