86 citations · 102 across the 13 of their papers we have counts for
17 papers · 1 filter
Speedup of Distributed Algorithms for Power Graphs in the CONGEST Model
Leonid Barenboim, Uri Goldenberg
We obtain improved distributed algorithms in the CONGEST message-passing setting for problems on power graphs of an input graph . This includes Coloring, Maximal Independent Set…
Deterministic Logarithmic Completeness in the Distributed Sleeping Model
Leonid Barenboim, Tzalik Maimon
We provide a deterministic scheme for solving any decidable problem in the distributed {sleeping model}. The sleeping model is a generalization of the standard message-passing mode…
Secured Distributed Algorithms Without Hardness Assumptions
Leonid Barenboim, Harel Levin
We study algorithms in the distributed message-passing model that produce secured output, for an input graph . Specifically, each vertex computes its part in the output, the ent…
Distributed K-Backup Placement and Applications to Virtual Memory in Real-World Wireless Networks
Gal Oren, Leonid Barenboim
The Backup Placement problem in networks in the distributed setting considers a network graph , in which the goal of each vertex is selecti…
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…
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…