PODC 2021 — Session 5 Talk 5 — The Randomized Local Computation Complexity of the Lovász Local Lemma
158 views
About this video
Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by videoAnalyzes randomized local computation complexity for the Lovász Local Lemma, teaching probabilistic methods and distributed lower-bound proofs. PODC talk conveys theoretical results in randomized distributed algorithms.
Video by Association for Computing Machinery (ACM), played through YouTube's embedded player.
Part of ACM PODC 2021