We propose a new self-stabilizing anonymous leader election algorithm in a tree graph. We show the correctness of the protocol and show that the protocol terminates in O(n4 ) time...
In this contribution we present a novel general model for adaptive processors with organic features. We describe its basic principle of operation. The adaptive operations that are ...
This paper is a guided tour through the theory of fibring as a general mechanism for combining logics. We present the main ideas, constructions and difficulties of fibring, from ...
We introduce a new way to compute common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple an...
Anne Bergeron, Cedric Chauve, Fabien de Montgolfie...
Given a sequence A of numbers and two positive integers and k, we study the problem to find k disjoint segments of A, each has length at least , such that their sum of densities i...