Skip to content

Session 3A - Walking Randomly, Massively, and Efficiently

About this video

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

Covers efficient and scalable random walk algorithms, addressing both theory and distributed computation. Presents practical algorithmic techniques for graph traversal.

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

Part of STOC 2020