activity
20102026
most citedDistributed Edge Coloring with Small Palettes and a Special Case of the Constructive Lovász Local Lemma

26 citations · 100 across the 29 of their papers we have counts for

collaborators
Showing 2024Show all

2 papers · 1 filter

cs.DC2024

Shared Randomness Helps with Local Distributed Problems

Alkida Balliu, Mohsen Ghaffari, Fabian Kuhn +5

By prior work, we have many results related to distributed graph algorithms for problems that can be defined with local constraints; the formal framework used in prior work is loca…

cs.DC2024

Adaptive Massively Parallel Coloring in Sparse Graphs

Rustam Latypov, Yannic Maus, Shreyas Pai +1

Classic symmetry-breaking problems on graphs have gained a lot of attention in models of modern parallel computation. The Adaptive Massively Parallel Computation (AMPC) is a model…