19 citations · 81 across the 40 of their papers we have counts for
3 papers · 1 filter
Unbeatable Set Consensus via Topological and Combinatorial Reasoning
Armando Castañeda, Yannai A. Gonczarowski, Yoram Moses
The set consensus problem has played an important role in the study of distributed systems for over two decades. Indeed, the search for lower bounds and impossibility results for t…
Unbeatable Consensus
Armando Castañeda, Yannai A. Gonczarowski, Yoram Moses
The unbeatability of a consensus protocol, introduced by Halpern, Moses and Waarts in 2001, is a stronger notion of optimality than the accepted notion of early stopping protocols.…
Good, Better, Best! - Unbeatable Protocols for Consensus and Set Consensus
Armando Castañeda, Yannai A. Gonczarowski, Yoram Moses
While the very first consensus protocols for the synchronous model were designed to match the worst-case lower bound, deciding in exactly t+1 rounds in all runs, it was soon realiz…