7 citations · 19 across the 16 of their papers we have counts for
18 papers
Can Like Attract Like? A Study of Homonymous Gathering in Networks
Stéphane Devismes, Yoann Dieudonné, Arnaud Labourel
A team of mobile agents, starting from distinct nodes of a network, have to meet at the same node and declare that they all met. Agents execute the same algorithm, which they start…
Graph Exploration: The Impact of a Distance Constraint
Stéphane Devismes, Yoann Dieudonné, Arnaud Labourel
A mobile agent, starting from a node of a simple undirected connected graph , has to explore all nodes and edges of using the minimum number of edge traversals. To…
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…
Analysis of a Memory-Efficient Self-Stabilizing BFS Spanning Tree
Ajoy K. Datta, Stéphane Devismes, Colette Johnen +1
We present results on the last topic we collaborate with our late friend, Professor Ajoy Kumar Datta (1958-2019). In this work, we shed new light on a self-stabilizing wave algorit…
Infinite Grid Exploration by Disoriented Robots
Quentin Bramas, Stephane Devismes, Pascal Lafourcade
We deal with a set of autonomous robots moving on an infinite grid. Those robots are opaque, have limited visibility capabilities, and run using synchronous Look-Compute-Move cycle…