26 citations · 35 across the 7 of their papers we have counts for
Showing cs.DCShow all
3 papers · 1 filter
cs.DC2017
An Optimal Distributed -Coloring Algorithm?
Yi-Jun Chang, Wenzheng Li, Seth Pettie
Vertex coloring is one of the classic symmetry breaking problems studied in distributed computing. In this paper we present a new algorithm for -list coloring in the randomi…
cs.DC2017★ 2 cited
The Energy Complexity of Broadcast
Yi-Jun Chang, Varsha Dani, Thomas P. Hayes +3
Energy is often the most constrained resource in networks of battery-powered devices, and as devices become smaller, they spend a larger fraction of their energy on communication (…
cs.DC2017★ 26 cited
Distributed Edge Coloring with Small Palettes and a Special Case of the Constructive Lovász Local Lemma
Yi-Jun Chang, Qizheng He, Wenzheng Li +2
We explore the complexity of edge coloring in the LOCAL model in different palette size regimes. 1. Lower Bounds: First, we simplify the round elimination technique of Brandt et al…