Dijkstra defined a distributed system to be self-stabilizing if, regardless of the initial state, the
system is guaranteed to reach a legitimate (correct) state in a finite time. Even though the …

We perform an extensive experimental evaluation of very simple, distributed, randomized
algorithms for (Δ+ 1) and so-called Brooks–Vizing vertex colorings, ie, colorings using …

In this paper, we specify the conflict manager abstraction. Informally, a conflict manager
guarantees that any two nodes that are in conflict cannot enter their critical section …

We contribute to the theoretical understanding of randomized search heuristics for dynamic
problems. We consider the classical graph coloring problem and investigate the dynamic …

The problem of assigning frequencies to processes so as to avoid interference can in many
instances be modeled as a graph coloring problem on the processor graph where no two …

Self-stabilizing protocols can tolerate any type and any number of transient faults. However,
in general, self-stabilizing protocols provide no guarantee about their behavior against …

Graph coloring is a challenging combinatorial optimization problem with a wide range of
applications. In this paper, a distribution evolutionary algorithm based on a population of …

We propose distributed algorithms for two well-established problems that operate efficiently
under extremely harsh conditions. Our algorithms achieve state-of-the-art performance in a …

Garbage collection plays a central role of flash-based solid state drive performance, in
particular, its endurance. Analytical modeling is an indispensable instrument for design …

Online social network has developed significantly in recent years. Most of current research
has utilized the property of online social network to spread information and ideas. Motivated …