8 citations · 39 across the 20 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DC2022
What Can We Compute in a Single Round of the Congested Clique?
Peter Robinson
We show that any one-round algorithm that computes a minimum spanning tree (MST) in the unicast congested clique must use a link bandwidth of bits in the worst case.…
cs.DC2022
Byzantine-Resilient Counting in Networks
Soumyottam Chatterjee, Gopal Pandurangan, Peter Robinson
We present two distributed algorithms for the {\em Byzantine counting problem}, which is concerned with estimating the size of a network in the presence of a large number of Byzant…