8 citations · 8 across the 2 of their papers we have counts for
4 papers
On the Hardness of the Strongly Dependent Decision Problem
Martin Biely, Peter Robinson
We present necessary and sufficient conditions for solving the strongly dependent decision (SDD) problem in various distributed systems. Our main contribution is a novel characteri…
Gracefully Degrading Consensus and -Set Agreement in Directed Dynamic Networks
Martin Biely, Peter Robinson, Ulrich Schmid +2
We study distributed agreement in synchronous directed dynamic networks, where an omniscient message adversary controls the availability of communication links. We prove that conse…
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…
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…