PODC 2021 — Session 9 Talk 4 — A Tight Lower Bound for the RMR Complexity of Recoverable Mutual...

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

Provides tight lower bounds on RMR complexity for recoverable mutual exclusion, teaching synchronization-algorithm analysis and complexity theory. PODC talk conveys distributed lower-bound techniques.

A 19-minute video from Association for Computing Machinery (ACM): “PODC 2021 — Session 9 Talk 4 — A Tight Lower Bound for the RMR Complexity of Recoverable Mutual...”.

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

Part of ACM PODC 2021