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

26 citations · 151 across the 34 of their papers we have counts for

collaborators
Showing 2016 · cs.CCShow all

1 paper · 2 filters

cs.CC2016★ 18 cited

An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model

Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie

Over the past 30 years numerous algorithms have been designed for symmetry breaking problems in the LOCAL model, such as maximal matching, MIS, vertex coloring, and edge-coloring.…