4 citations · 4 across the 4 of their papers we have counts for
5 papers
Trade-off between Time, Space, and Workload: the case of the Self-stabilizing Unison
Stéphane Devismes, David Ilcinkas, Colette Johnen +1
We present a self-stabilizing algorithm for the (asynchronous) unison problem which achieves an efficient trade-off between time, workload, and space in a weak model. Precisely, ou…
Making local algorithms efficiently self-stabilizing in arbitrary asynchronous environments
Stéphane Devismes, David Ilcinkas, Colette Johnen +1
This paper deals with the trade-off between time, workload, and versatility in self-stabilization, a general and lightweight fault-tolerant concept in distributed computing.In this…
Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps
Stéphane Devismes, David Ilcinkas, Colette Johnen
We deal with the problem of maintaining a shortest-path tree rooted at some process r in a network that may be disconnected after topological changes. The goal is then to maintain…
Optimal Exploration of Terrains with Obstacles
Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel +1
A mobile robot represented by a point moving in the plane has to explore an unknown terrain with obstacles. Both the terrain and the obstacles are modeled as arbitrary polygons. We…
More efficient periodic traversal in anonymous undirected graphs
J. Czyzowicz, S. Dobrev, L. Gasieniec +7
We consider the problem of periodic graph exploration in which a mobile entity with constant memory, an agent, has to visit all n nodes of an arbitrary undirected graph G in a peri…