8 citations · 39 across the 20 of their papers we have counts for
Showing 2011 · cs.DCShow all
2 papers · 2 filters
cs.DC2011
Easy Impossibility Proofs for k-Set Agreement in Message Passing Systems
Martin Biely, Peter Robinson, Ulrich Schmid
Despite of being quite similar agreement problems, consensus and general k-set agreement require surprisingly different techniques for proving the impossibility in asynchronous sys…
cs.DC2011★ 8 cited
Solving k-Set Agreement with Stable Skeleton Graphs
Martin Biely, Peter Robinson, Ulrich Schmid
In this paper we consider the k-set agreement problem in distributed message-passing systems using a round-based approach: Both synchrony of communication and failures are captured…