3 papers
cs.DC2025
Lower Bounds for -Set Agreement in Fault-Prone Networks
Pierre Fraigniaud, Minh Hang Nguyen, Ami Paz +2
We develop a new lower bound for k-set agreement in synchronous message-passing systems connected by an arbitrary directed communication network, where up to t processes may crash.…
cs.DC2025
Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structure
Pierre Fraigniaud, Minh Hang Nguyen, Ami Paz
Consensus is arguably the most studied problem in distributed computing as a whole, and particularly in the distributed message-passing setting. In this latter framework, research…
cs.DC2025
A Simple Lower Bound for Set Agreement in Dynamic Networks
Pierre Fraigniaud, Minh Hang Nguyen, Ami Paz
Given a positive integer , -set agreement is the distributed task in which each process in a group of processing nodes starts with an input value in the…