Conditional Hardness Results for Massively Parallel Computation from Distributed Lower Bounds
Offered By: IEEE via YouTube
Course Description
Overview
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
Related Courses
Advanced Operating SystemsGeorgia Institute of Technology via Udacity High Performance Computing
Georgia Institute of Technology via Udacity GT - Refresher - Advanced OS
Georgia Institute of Technology via Udacity Distributed Machine Learning with Apache Spark
University of California, Berkeley via edX CS125x: Advanced Distributed Machine Learning with Apache Spark
University of California, Berkeley via edX