32 citations · 98 across the 32 of their papers we have counts for
1 paper · 1 filter
Arkadev Chattopadhyay, Michael Langberg, Shi Li +1
We prove tight network topology dependent bounds on the round complexity of computing well studied k-party functions such as set disjointness and element distinctness. Unlike the…