-
Linear Space Boostrap Communication Scheme
We consider a system of $n$ processes with ids not a priori known, that are drown from a large space, potentially unbounded. How can these $n$ processes communicate to... -
A Note on the Space Complexity of Fast D-Finite Function Evaluation
International audience -
Improved Bounds for Bipartite Matching on Surfaces
International audience -
A new self-stabilizing minimum spanning tree construction with loop-free prop...
International audience -
Fast Self-Stabilizing Minimum Spanning Tree Construction Using Compact Neares...
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is $O(\log^2n)$ bits and it converges... -
Allocation adaptative de registres en utilisant un nombre linéaire de registres
International audience -
Asynchronous Consensus with Bounded Memory
We present here a bounded memory consensus Obstruction-Free algorithm for the asynchronous shared memory model. More precisely for a set of n processes, this algorithm...
