The past few years have seen intensive research efforts carried out in some apparently
unrelated areas of dynamic systems–delay-tolerant networks, opportunistic-mobility …

A temporal graph is, informally speaking, a graph that changes with time. When time is
discrete and only the relationships between the participating entities may change and not …

The boom of social network platforms has greatly enriched people's platform choices for
social interactions, which may cause people to switch frequently in different social networks …

With the development of the information and Internet technology, the public opinions with big
data will rapidly emerge in an online-offline social network, and an inefficient management …

In this issue of the distributed computing column, Kyrill Winkler and Ulrich Schmid present
an interesting survey of recent research trends on consensus proto-cols in dynamic …

We study the problem of solving consensus in synchronous directed dynamic networks, in
which communication is controlled by an oblivious message adversary that picks the …

We investigate the approximate consensus problem in highly dynamic networks in which
topology may change continually and unpredictably. We prove that in both synchronous and …

The gathering (or multi-agent rendezvous) problem requires a set of mobile agents,
arbitrarily positioned at different nodes of a network to group within finite time at the same …

Motivated by the need for robust and fast distributed computation in highly dynamic Peer-to-
Peer (P2P) networks, we study algorithms for the fundamental distributed agreement …

We study Byzantine agreement in dynamic networks where topology can change from round
to round and nodes can also experience heavy churn (ie, nodes can join and leave the …