3 papers
cs.DC2023
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…
cs.DC2023
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…
cs.DM2009
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…