A self-stabilizing memory efficient algorithm for the minimum diameter spanning tree under an omnipotent daemon

Autor: Blin, Lélia ^a, Boubekeur, Fadwa ^b, Dubois, Swan ^{c, *}

Publikováno v: In Journal of Parallel and Distributed Computing July 2018 117:50-62

Self-stabilizing silent disjunction in an anonymous network

Autor: Datta, Ajoy K. ^a, Devismes, Stéphane ^{b, ⁎}, Larmore, Lawrence L. ^a

Publikováno v: In Theoretical Computer Science 22 February 2017 665:51-72

Self-stabilizing [formula omitted]-alliances with safe convergence

Autor: Carrier, Fabienne ^b, Datta, Ajoy K. ^a, Devismes, Stéphane ^{b, ⁎}, Larmore, Lawrence L. ^a, Rivierre, Yvan ^b

Publikováno v: In Journal of Parallel and Distributed Computing July 2015 81-82:11-23

An [formula omitted]-time self-stabilizing leader election algorithm

Autor: Datta, Ajoy K. ^⁎, Larmore, Lawrence L., Vemula, Priyanka

Publikováno v: In Journal of Parallel and Distributed Computing 2011 71(11):1532-1544

Brief Announcement: Analysis of a Memory-Efficient Self-stabilizing BFS Spanning Tree Construction

Autor: Colette Johnen, Ajoy K. Datta, Stéphane Devismes, Lawrence L. Larmore

Publikováno v: 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2019)
21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2019), Oct 2019, Pise, Italy. pp.99-104, ⟨10.1007/978-3-030-34992-9_8⟩
Lecture Notes in Computer Science ISBN: 9783030349912
SSS

We present preliminary results on the last topic we collaborate with our late friend, Professor Ajoy Kumar Datta (1958–2019), who prematurely left us a few months ago. In this work, we shed new light on a self-stabilizing wave algorithm proposed by

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e4d5ccb1ecbcf0e3a1dbc911ee5d84a2
https://hal.archives-ouvertes.fr/hal-02489447