1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.DC2022★ 1 cited
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…
cs.DC2019
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…