Untitled Page 1 Page 2 92 sHE~L~ A. Gm~AC~ whether there are other subAFLs and which
properties they do or do not share witty. the whole family. Here we define and study a doubly …

We present Corona, a deterministic self-stabilizing algorithm for skip list construction in
structured overlay networks. Corona operates in the low-atomicity message-passing …

We propose a general framework to build certified proofs of distributed self-stabilizing
algorithms with the proof assistant Coq. We first define in Coq the locally shared memory …

This paper presents a dynamic overlay network based on the De Bruijn graph which we call
Linearized De Bruijn (LDB) network. The LDB network has the advantage that it has a …

We present Tiara—a self-stabilizing peer-to-peer network maintenance algorithm. Tiara is
truly deterministic which allows it to achieve exact performance bounds. Tiara allows …

We propose a self-stabilizing reset algorithm working in anonymous networks. This
algorithm resets the network in a distributed non-centralized manner, as each process …

A snap-stabilizing algorithm, regardless of the initial configuration of the system, guarantees
that it always behaves according to its specification. We consider here the locally shared …

We propose a new metric for effectively and accurately evaluating the performance of self-
stabilizing algorithms. Self-stabilization is a versatile category of fault-tolerance that …

We present Tiara—a self-stabilizing peer-to-peer network maintenance algorithm. Tiara is
truly deterministic which allows it to achieve exact performance bounds. Tiara allows …

A fundamental problem for peer-to-peer systems is to maintain connectivity while nodes are
leaving, ie, the nodes requesting to leave the peer-to-peer system are excluded from the …