BrighterTube

Session 3A -Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization

Association for Computing Machinery (ACM)49.8K subscribers

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

Develops polylogarithmic-time distributed algorithms for network decomposition and derandomization. Teaches parallel and distributed algorithmic techniques for network problems.

A 25-minute video from Association for Computing Machinery (ACM): “Session 3A -Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization”.

Programming & CSScience & Math

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

Part of STOC 2020