17 citations · 18 across the 6 of their papers we have counts for
7 papers
Topological Characterization of Consensus Solvability in Directed Dynamic Networks
Hugo Rincon Galeana, Ulrich Schmid, Kyrill Winkler +2
Consensus is one of the most fundamental problems in distributed computing. This paper studies the consensus problem in a synchronous dynamic directed network, in which communicati…
Time Complexity of Consensus in Dynamic Networks Under Oblivious Message Adversaries
Ami Paz, Hugo Rincon Galeana, Stefan Schmid +2
Consensus is a most fundamental task in distributed computing. This paper studies the consensus problem for a set of processes connected by a dynamic directed network, in which com…
Topological Characterization of Consensus in Distributed Systems
Thomas Nowak, Ulrich Schmid, Kyrill Winkler
We provide a complete characterization of both uniform and non-uniform deterministic consensus solvability in distributed systems with benign process and communication faults using…
On the Radius of Nonsplit Graphs and Information Dissemination in Dynamic Networks
Matthias Függer, Thomas Nowak, Kyrill Winkler
A nonsplit graph is a directed graph where each pair of nodes has a common incoming neighbor. We show that the radius of such graphs is in , where is the number…
Consensus in Rooted Dynamic Networks with Short-Lived Stability
Kyrill Winkler, Manfred Schwarz, Ulrich Schmid
We consider the problem of solving consensus using deterministic algorithms in a synchronous dynamic network with unreliable, directional point-to-point links, which are under the…
Fast Consensus under Eventually Stabilizing Message Adversaries
Manfred Schwarz, Kyrill Winkler, Ulrich Schmid
This paper is devoted to deterministic consensus in synchronous dynamic networks with unidirectional links, which are under the control of an omniscient message adversary. Motivate…
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…