In this work we consider temporal networks, ie networks defined by a labeling λ λ assigning
to each edge of an underlying graph G a set of discrete time-labels. The labels of an edge …

In this work we consider temporal networks, ie networks defined by a labeling λ assigning to
each edge of an underlying graph G a set of discrete time-labels. The labels of an edge …

We study the design of small cost temporally connected graphs, under various constraints.
We mainly consider undirected graphs of n vertices, where each edge has an associated set …

In this work, we study the fundamental naming and counting problems (and some variations)
in networks that are anonymous, unknown, and possibly dynamic. In counting, nodes must …

In this work, we study the propagation of influence and computation in dynamic distributed
computing systems that are possibly disconnected at every instant. We focus on a …

We consider here a model of temporal networks, the links of which are available only at
certain moments in time, chosen randomly from a subset of the positive integers. We define …

Counting is a fundamental problem of every distributed system as it represents a basic
building block to implement high level abstractions. In anonymous dynamic networks …

We study the design of small cost temporally connected graphs, under various constraints.
We mainly consider undirected graphs of n vertices, where each edge has an associated set …

An interval temporal network is, informally speaking, a network whose links change with
time. The term interval means that a link may exist for one or more time intervals, called …

In this paper we consider a static set of anonymous processes, ie, they do not have
distinguished IDs, that communicate with neighbors using a local broadcast primitive. The …