Besides the complexity in time or in number of messages, a common approach for analyzing
distributed algorithms is to look at their assumptions on the underlying network. This paper …

This paper considers the computational power of anonymous message passing algorithms
(henceforth, anonymous algorithms), ie, distributed algorithms operating in a network of …

Natural distributed systems are adaptive, scalable and fault-tolerant. Emergence science
describes how higher-level self-regulatory behaviour arises in natural systems from many …

We present a general method and a toolkit for designing, implementing and visualizing
distributed algorithms. We make use of the high level encoding of distributed algorithms as …

We present new efficient deterministic and randomized distributed algorithms for
decomposing a graph with n nodes into a disjoint set of connected clusters with radius at …

A new technique for segmenting and tracking human faces in video sequences is presented.
The technique relies on morphological tools such as using connected operators to extract …

This paper presents efficient deterministic and randomized distributed algorithms for
decomposing a graph with n nodes into a disjoint set of connected clusters with small radius …

Mobile agents are a well-known paradigm for the design and implementation of distributed
systems. However, whilst their popularity continues to grow, a uniform theory of mobile agent …

Visidia is a tool for the simulation and the visualization of distributed algorithms. The
simulation has been done using one machine [M. Bauderon et al.,(2002)]. We present an …

In many large, distributed or mobile networks, broadcast algorithms are used to update
information stored at the nodes. In this paper, we propose a new model of communication …