86 citations · 102 across the 13 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DC2018
Distributed Symmetry-Breaking with Improved Vertex-Averaged Complexity
Leonid Barenboim, Yaniv Tzur
We study the distributed message-passing model in which a communication network is represented by a graph G=(V,E). Usually, the measure of complexity that is considered in this mod…
cs.DC2018
Distributed Symmetry-Breaking Algorithms for Congested Cliques
Leonid Barenboim, Victor Khazanov
The {Congested Clique} is a distributed-computing model for single-hop networks with restricted bandwidth that has been very intensively studied recently. It models a network by an…