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
Automata TheoryStanford University via edX Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX 算法设计与分析 Design and Analysis of Algorithms
Peking University via Coursera How to Win Coding Competitions: Secrets of Champions
ITMO University via edX Introdução à Ciência da Computação com Python Parte 2
Universidade de São Paulo via Coursera