Sur l'auto-stabilisation dans un réseau d'ordinateurs
RAIRO. Inform. théor., 15 1 (1981) 47-66
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
A Simple 2-Approximation for Maximum-Leaf Spanning Tree
I-Cheng Liao and Hsueh-I LuInternational Journal of Foundations of Computer Science 34 (07) 795 (2023)
https://doi.org/10.1142/S0129054123420029
Edsger Wybe Dijkstra
Ted HermanEdsger Wybe Dijkstra 81 (2022)
https://doi.org/10.1145/3544585.3544592
On the performance of Dijkstra’s third self-stabilizing algorithm for mutual exclusion and related algorithms
Viacheslav Chernoy, Mordechai Shalom and Shmuel ZaksDistributed Computing 23 (1) 43 (2010)
https://doi.org/10.1007/s00446-010-0104-6
Stabilization, Safety, and Security of Distributed Systems
Viacheslav Chernoy, Mordechai Shalom and Shmuel ZaksLecture Notes in Computer Science, Stabilization, Safety, and Security of Distributed Systems 4838 114 (2007)
https://doi.org/10.1007/978-3-540-76627-8_11
Self-Stabilizing Systems
Shlomi Dolev and Elad SchillerLecture Notes in Computer Science, Self-Stabilizing Systems 2704 61 (2003)
https://doi.org/10.1007/3-540-45032-7_5
Self-Stabilizing Systems
Sébastien TixeuilLecture Notes in Computer Science, Self-Stabilizing Systems 2194 216 (2001)
https://doi.org/10.1007/3-540-45438-1_15
OPTIMALITY AND SELF-STABILIZATION IN ROOTED TREE NETWORKS
FRANCK PETIT and VINCENT VILLAINParallel Processing Letters 10 (01) 3 (2000)
https://doi.org/10.1142/S0129626400000032
70 (1999)
https://doi.org/10.1109/SLFSTB.1999.777489
OPTIMALITY AND SELF-STABILIZATION IN ROOTED TREE NETWORKS
FRANCK PETIT and VINCENT VILLAINParallel Processing Letters 09 (03) 313 (1999)
https://doi.org/10.1142/S0129626499000293
44 (1998)
https://doi.org/10.1109/PCCC.1998.659897
Approximating Maximum Leaf Spanning Trees in Almost Linear Time
Hsueh-I Lu and R RaviJournal of Algorithms 29 (1) 132 (1998)
https://doi.org/10.1006/jagm.1998.0944
317 (1997)
https://doi.org/10.1109/ISPAN.1997.645114
Resource Bounds for Self-Stabilizing Message-Driven Protocols
Shlomi Dolev, Amos Israeli and Shlomo MoranSIAM Journal on Computing 26 (1) 273 (1997)
https://doi.org/10.1137/S0097539792235074
Distributed Algorithms
Colette Johnen, Gianluigi Alari, Joffroy Beauquier and Ajoy K. DattaLecture Notes in Computer Science, Distributed Algorithms 1320 260 (1997)
https://doi.org/10.1007/BFb0030689
52 (1996)
https://doi.org/10.1109/SPDP.1996.570316
EVENTUAL DETERMINISM: USING PROBABILISTIC MEANS TO ACHIEVE DETERMINISTIC ENDS
JOSYULA R. RAOParallel Algorithms and Applications 8 (1) 3 (1996)
https://doi.org/10.1080/10637199608915541
29 (1995)
https://doi.org/10.1109/HICSS.1995.375480
A short note on the approximability of the maximum leaves spanning tree problem
G. Galbiati, F. Maffioli and A. MorzentiInformation Processing Letters 52 (1) 45 (1994)
https://doi.org/10.1016/0020-0190(94)90139-2
Two-state self-stabilizing algorithms for token rings
M. Flatebo and A.K. DattaIEEE Transactions on Software Engineering 20 (6) 500 (1994)
https://doi.org/10.1109/32.295897
Self-stabilization
Marco SchneiderACM Computing Surveys 25 (1) 45 (1993)
https://doi.org/10.1145/151254.151256
Self-stabilization of dynamic systems assuming only read/write atomicity
Shlomi Dolev, Amos Israeli and Shlomo MoranDistributed Computing 7 (1) 3 (1993)
https://doi.org/10.1007/BF02278851
198 (1992)
https://doi.org/10.1109/IPPS.1992.223047
Binary self-stabilization in distributed systems
Sukumar GhoshInformation Processing Letters 40 (3) 153 (1991)
https://doi.org/10.1016/0020-0190(91)90172-E
Distributed Algorithms
Amos Israeli and Marc JalfonLecture Notes in Computer Science, Distributed Algorithms 486 1 (1991)
https://doi.org/10.1007/3-540-54099-7_1
1 (1989)
https://doi.org/10.1109/EEIS.1989.720146
VLSI Algorithms and Architectures
James E. Burns and Jan PachlLecture Notes in Computer Science, VLSI Algorithms and Architectures 319 391 (1988)
https://doi.org/10.1007/BFb0040406
Arbres avec un nombre maximum de sommets pendants
C Payan, M Tchuente and N.H XuongDiscrete Mathematics 49 (3) 267 (1984)
https://doi.org/10.1016/0012-365X(84)90163-8