86 citations · 102 across the 13 of their papers we have counts for
Showing 2010Show all
3 papers · 1 filter
cs.DC2010
Distributed Deterministic Edge Coloring using Bounded Neighborhood Independence
Leonid Barenboim, Michael Elkin
We study the {edge-coloring} problem in the message-passing model of distributed computing. This is one of the most fundamental and well-studied problems in this area. Currently, t…
cs.DC2010★ 3 cited
Deterministic and Energy-Optimal Wireless Synchronization
Leonid Barenboim, Shlomi Dolev, Rafail Ostrovsky
We consider the problem of clock synchronization in a wireless setting where processors must power-down their radios in order to save energy. Energy efficiency is a central goal in…
cs.DC2010
Deterministic Distributed Vertex Coloring in Polylogarithmic Time
Leonid Barenboim, Michael Elkin
Consider an n-vertex graph G = (V,E) of maximum degree Delta, and suppose that each vertex v \in V hosts a processor. The processors are allowed to communicate only with their neig…