Tight Network Topology Dependent Bounds on Rounds of Communication

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…