2 papers
cs.DC2025
Perfect Matching with Few Link Activations
Hugo Mirault, Peter Robinson, Ming Ming Tan +1
We consider the problem of computing a perfect matching problem in a synchronous distributed network, where the network topology corresponds to a complete bipartite graph. The comm…
cs.DC2025
Time-Optimal and Energy-Efficient Deterministic Consensus
Shachar Meir, Hugo Mirault, David Peleg +1
We study fault-tolerant consensus in a variant of the synchronous message passing model, where, in each round, every node can choose to be awake or asleep. This is known as the sle…