86 citations · 102 across the 13 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DC2020
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…
cs.DC2020
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…