Explore a groundbreaking IEEE conference talk on exponentially faster massively parallel maximal matching algorithms. Delve into cutting-edge research presented by Soheil Behnezhad, MohammadTaghi Hajiaghayi, and David G. Harris as they discuss innovative techniques for improving computational efficiency in parallel computing environments. Gain insights into advanced graph theory concepts and their practical applications in solving complex matching problems.
Exponentially Faster Massively Parallel Maximal Matching
Overview
Syllabus
Exponentially Faster Massively Parallel Maximal Matching
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
-
Near Optimal Massively Parallel Graph Connectivity
-
An Introduction to Distributed, Massively Parallel, and Local Computation Algorithms
-
Faster Parallel Algorithms for Basic Linear Algebra Problems
-
Massively Parallel Algorithms for High-Dimensional Euclidean Minimum Spanning Tree
-
Conditional Hardness for Massively Parallel Computing Via Distributed Lower Bounds
-
Recent Progress on Sublinear Time Algorithms for Maximum Matching - Upper Bounds
