2 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.DC2024
Topological Characterization of Stabilizing Consensus
Ulrich Schmid, Stephan Felber, Hugo Rincon-Galeana
We provide a complete characterization of the solvability/impossibility of deterministic stabilizing consensus in any computing model with benign process and communication faults u…