3 citations · 6 across the 5 of their papers we have counts for
1 paper · 2 filters
Leonid Barenboim, Harel Levin
We study algorithms in the distributed message-passing model that produce secured output, for an input graph G. Specifically, each vertex computes its part in the output, the ent…