Explore fundamental impossibility results in distributed computing through this insightful lecture by Faith Ellen from the University of Toronto. Delve into the challenges and limitations faced in distributed systems as part of the Lower Bounds in Computational Complexity Boot Camp. Gain a deeper understanding of the theoretical foundations that shape the field of distributed computing and their implications for system design and implementation.
Impossibility Results for Distributed Computing I
Overview
Syllabus
Impossibility Results for Distributed Computing I
Taught by
Simons Institute
Related Courses
-
Cloud Computing and Distributed Systems
-
Conditional Hardness for Massively Parallel Computing Via Distributed Lower Bounds
-
Modern Distributed Systems
-
Conditional Hardness Results for Massively Parallel Computation from Distributed Lower Bounds
-
Circuit Lower Bounds from Algorithm Design - An Overview I
-
Developing FPGA-accelerated cloud applications with SDAccel: Practice
