Session 3A - Faster Parallel Algorithm for Approximate Shortest Path

About this video

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

Presents faster parallel algorithms for approximate shortest path computation. Teaches distributed and parallel algorithm design for graph problems.

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

Part of STOC 2020