YoVDO

Sparsification for Communication-Efficient Distributed Symmetry-Breaking

Offered By: Simons Institute via YouTube

Tags

Distributed Computing Courses Graph Theory Courses Symmetry Breaking Courses Sublinear Algorithms Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore sparsification techniques for enhancing communication efficiency in distributed symmetry-breaking algorithms during this 32-minute lecture by Yannic Maus from TU Graz. Delve into various approaches designed specifically for the CONGEST model, with a primary focus on local symmetry-breaking challenges such as graph coloring, ruling sets, and the Lovász Local Lemma. Gain insights into sublinear graph simplification methods and their applications in improving algorithmic performance in distributed computing environments.

Syllabus

Sparsification for communication-efficient distributed symmetry-breaking


Taught by

Simons Institute

Related Courses

Aplicaciones de la teoría de grafos a la vida real
Miríadax
Aplicaciones de la Teoría de Grafos a la vida real
Universitat Politècnica de València via UPV [X]
Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX
Genome Sequencing (Bioinformatics II)
University of California, San Diego via Coursera
Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer