86 citations · 102 across the 13 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DC2019★ 2 cited
Distributed Backup Placement in One Round and its Applications to Maximum Matching Approximation and Self-Stabilization
Leonid Barenboim, Gal Oren
In the distributed backup-placement problem each node of a network has to select one neighbor, such that the maximum number of nodes that make the same selection is minimized. This…
cs.DC2019★ 1 cited
Fast Distributed Backup Placement in Sparse and Dense Networks
Leonid Barenboim, Gal Oren
We consider the Backup Placement problem in networks in the distributed setting. Given a network graph , the goal of each vertex is selecti…