8 citations · 39 across the 20 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.DC2023
The Message Complexity of Distributed Graph Optimization
Fabien Dufoulon, Shreyas Pai, Gopal Pandurangan +2
The message complexity of a distributed algorithm is the total number of messages sent by all nodes over the course of the algorithm. This paper studies the message complexity of d…
cs.DC2023★ 2 cited
Improved Tradeoffs for Leader Election
Shay Kutten, Peter Robinson, Ming Ming Tan +1
We consider leader election in clique networks, where nodes are connected by point-to-point communication links. For the synchronous clique under simultaneous wake-up, i.e., wh…