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.
Conditional Hardness Results for Massively Parallel Computation from Distributed Lower Bounds
Overview
Syllabus
Conditional Hardness Results for Massively Parallel Computation from Distributed Lower Bounds
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
-
Conditional Hardness for Massively Parallel Computing Via Distributed Lower Bounds
-
An Introduction to Distributed, Massively Parallel, and Local Computation Algorithms
-
Circuit Lower Bounds from Algorithm Design - An Overview I
-
Strong Average-Case Circuit Lower Bounds from Non-trivial Derandomization
-
Almost-Everywhere Circuit Lower Bounds from Non-Trivial Derandomization
-
Strong Average-Case Circuit Lower Bounds from Non-trivial Derandomization - Lijie Chen
