PODC 2021 — Session 4 Talk 3 — Constant-Round Spanners and Shortest Paths in Congested Clique & MPC

About this video

Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidence

Discusses constant-round spanners and shortest paths in congested clique and MPC models, teaching distributed routing and communication-efficient algorithms. PODC talk conveys advanced distributed-graph algorithms.

A 19-minute video from Association for Computing Machinery (ACM): “PODC 2021 — Session 4 Talk 3 — Constant-Round Spanners and Shortest Paths in Congested Clique & MPC”.

Video by Association for Computing Machinery (ACM), played through YouTube's embedded player.

Part of ACM PODC 2021