Get 20% off all career paths from fullstack to AI
Power BI Fundamentals - Create visualizations and dashboards from scratch
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore a 25-minute IEEE conference talk that delves into conditional hardness results for massively parallel computation derived from distributed lower bounds. Learn from experts Mohsen Ghaffari, Fabian Kuhn, and Jara Uitto as they present their findings and insights on this complex topic in computer science and distributed systems.
Syllabus
Conditional Hardness Results for Massively Parallel Computation from Distributed Lower Bounds
Taught by
IEEE FOCS: Foundations of Computer Science