Maurice Herlihy: Applying Combinatorial Topology to Byzantine Tasks
Offered By: Hausdorff Center for Mathematics via YouTube
Course Description
Overview
Explore the intersection of combinatorial topology and Byzantine tasks in this insightful 46-minute lecture by Maurice Herlihy, presented as part of the Hausdorff Trimester Program on Applied and Computational Algebraic Topology. Delve into the fascinating applications of topological concepts in solving complex distributed computing problems, particularly those involving Byzantine fault tolerance. Gain a deeper understanding of how mathematical principles can be leveraged to address challenges in distributed systems and enhance their resilience against malicious actors.
Syllabus
Maurice Herlihy: Applying Combinatorial Topology to Byzantine Tasks
Taught by
Hausdorff Center for Mathematics
Related Courses
PBFT and BlockchainsSimons Institute via YouTube Good-Case Latency of Byzantine Broadcast: A Complete Categorization
Association for Computing Machinery (ACM) via YouTube Sync HotStuff: Simple and Practical Synchronous State Machine Replication
IEEE via YouTube DispersedLedger - High-Throughput Byzantine Consensus on Variable Bandwidth Networks
USENIX via YouTube Scalable Bias-Resistant Distributed Randomness
IEEE via YouTube