TADDS

In recent years, several works have demonstrated how the study of biology can benefit from an algorithmic perspective. This approach may be particularly useful in the context of distributed computing, since biological systems are often distributed in ...

Dynamic large scale systems pose a great challenge to designers of efficient communication algorithms. Processors cannot rely any more on the gathered knowledge, as it may be entirely inadequate to the current state of the system and to the incoming ...

Dynamics in networks is caused by a variety of reasons, like nodes moving in 2D (or 3D) in multihop cellphone networks, joins and leaves in peer-to-peer networks, evolution in social networks, and many others. In order to understand such kinds of ...

The graph decomposition problem consists of dividing a graph into components, patterns or partitions which satisfy some specifications. In this paper, we give interest to graph decomposition into particular patterns: disjoint paths of length two. We ...

In this paper, we address the unison problem. We consider the self-stabilizing algorithm proposed by Boulinier et al. We exhibit a bound on the step complexity of its stabilization time. In more details, the stabilization time of this algorithm is at ...

A random walk in a network is a routing mechanism that chooses the next node to visit (uniformly) at random among the neighbors of the current node. Random walks have been extensively studied in Mathematics, and have been used in a wide range of ...

Consider a set of n processors traveling with bounded speed along continuous trajectories on a line and suppose that each processor must share a piece of information with all other processors in the set. This is known as the gossiping task. Each ...