Catalog · Design and Analysis of Algorithms Lecture 20 of 34 Lecture 20: Asynchronous Distributed Algorithms: Shortest-Paths Spanning Trees ← Previous Lecture 19: Synchronous Distributed Algorithms: Symmetry-Breaking. Shortest-Paths Spanning Trees Next → Lecture 21: Cryptography: Hash Functions ✓ Mark complete Materials Transcript (PDF) ↗ transcript