Coursera Plus Annual is 40% Off — Ends June 29.

Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Conditional Hardness Results for Massively Parallel Computation from Distributed Lower Bounds

IEEE via YouTube

Start learning Write review
OpenLearning Ad

Future-Proof Your Career: AI Manager Masterclass

Learn More → Boot.dev Ad

The Fastest Way to Become a Backend Developer Online

Learn More →

Overview

AI, Data Science & Cloud Certificates from Google, IBM & Meta — 40% Off
One plan covers every Professional Certificate on Coursera. 40% off Coursera Plus Annual.
Unlock All Certificates
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

Tags

Reviews

Start your review of Conditional Hardness Results for Massively Parallel Computation from Distributed Lower Bounds

Start learning

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free
Someone learning on their laptop while sitting on the floor.