Exponentially Faster Massively Parallel Maximal Matching
Offered By: IEEE via YouTube
Course Description
Overview
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.
Syllabus
Exponentially Faster Massively Parallel Maximal Matching
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
Intro to Parallel ProgrammingNvidia via Udacity Introduction to Linear Models and Matrix Algebra
Harvard University via edX Введение в параллельное программирование с использованием OpenMP и MPI
Tomsk State University via Coursera Supercomputing
Partnership for Advanced Computing in Europe via FutureLearn Fundamentals of Parallelism on Intel Architecture
Intel via Coursera