-
1
-
-
84944076702
-
Local and global properties in networks of processors
-
D. Angluin. Local and global properties in networks of processors. In Proc. Symp. on Theory of Computing(STOC'80), pages 82-93, 1980.
-
(1980)
Proc. Symp. on Theory of Computing(STOC'80)
, pp. 82-93
-
-
Angluin, D.1
-
2
-
-
34848875276
-
Stabilization-preserving atomicity refinement
-
A. Arora and M. Nesterenko. Stabilization-preserving atomicity refinement. DISC'99, pages 254-268, 1999.
-
(1999)
DISC'99
, pp. 254-268
-
-
Arora, A.1
Nesterenko, M.2
-
5
-
-
10644254831
-
When graph theory helps self-stabilization
-
Christian Boulinier, Franck Petit, and Vincent Villain. When graph theory helps self-stabilization. In PODC, pages 150-159, 2004.
-
(2004)
PODC
, pp. 150-159
-
-
Boulinier, C.1
Petit, F.2
Villain, V.3
-
6
-
-
33845533577
-
Self-stabilizing atomicity refinement allowing neighborhood concurrency
-
Self-Stabilizing Systems, 6th International Symposium, SSS 2003, San Francisco, CA, USA, June 24-25, 2003, Proceedings, of, Springer
-
Sébastien Cantarell, Ajoy Kumar Datta, and Franck Petit. Self-stabilizing atomicity refinement allowing neighborhood concurrency. In Self-Stabilizing Systems, 6th International Symposium, SSS 2003, San Francisco, CA, USA, June 24-25, 2003, Proceedings, volume 2704 of Lecture Notes in Computer Science, pages 102-112. Springer, 2003.
-
(2003)
Lecture Notes in Computer Science
, vol.2704
, pp. 102-112
-
-
Cantarell, S.1
Kumar Datta, A.2
Petit, F.3
-
7
-
-
22344435014
-
Optimal snap-stabilizing pif in un-oriented trees
-
A Cournier, AK Datta, F Petit, and V Villain. Optimal snap-stabilizing pif in un-oriented trees. Journal of High Speed Networks, 14(2): 185-204, 2005.
-
(2005)
Journal of High Speed Networks
, vol.14
, Issue.2
, pp. 185-204
-
-
Cournier, A.1
Datta, A.K.2
Petit, F.3
Villain, V.4
-
8
-
-
0037630650
-
Enabling snap-stabilization
-
Alain Cournier, Ajoy Kumar Datta, Franck Petit, and Vincent Villain. Enabling snap-stabilization. In ICDCS, pages 12-19, 2003.
-
(2003)
ICDCS
, pp. 12-19
-
-
Cournier, A.1
Kumar Datta, A.2
Petit, F.3
Villain, V.4
-
9
-
-
84976834622
-
Self-stabilizing systems in spite of distributed control
-
Edsger W. Dijkstra. Self-stabilizing systems in spite of distributed control. Commun. ACM, 17(11):643-644, 1974.
-
(1974)
Commun. ACM
, vol.17
, Issue.11
, pp. 643-644
-
-
Dijkstra, E.W.1
-
11
-
-
33746325499
-
Distance-information in self-stabilizing algorithms
-
Paola Flocchini and Leszek Gasieniec, editors, SIROCCO, of, Springer
-
Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, and Vilmar Trevisan. Distance-information in self-stabilizing algorithms. In Paola Flocchini and Leszek Gasieniec, editors, SIROCCO, volume 4056 of Lecture Notes in Computer Science, pages 349-356. Springer, 2006.
-
(2006)
Lecture Notes in Computer Science
, vol.4056
, pp. 349-356
-
-
Goddard, W.1
Hedetniemi, S.T.2
Pokrass Jacobs, D.3
Trevisan, V.4
-
12
-
-
34848917475
-
-
M. Gouda and F. Hadix. The alternator. In Proceedings of the Third Workshop on Self-Stabilizing Systems (published in association with ICDCS99 The 19th IEEE International Conference on Distributed Computing Systems), pages 48-53, 1999.
-
M. Gouda and F. Hadix. The alternator. In Proceedings of the Third Workshop on Self-Stabilizing Systems (published in association with ICDCS99 The 19th IEEE International Conference on Distributed Computing Systems), pages 48-53, 1999.
-
-
-
-
15
-
-
84937419986
-
Self-stabilizing neighborhood unique naming under unfair scheduler
-
Maria Gradinariu and Colette Johnen. Self-stabilizing neighborhood unique naming under unfair scheduler. In Euro-Par, pages 458-465, 2001.
-
(2001)
Euro-Par
, pp. 458-465
-
-
Gradinariu, M.1
Johnen, C.2
-
16
-
-
0042592950
-
Linear time self-stabilizing colorings
-
Stephen T. Hedetniemi, David Pokrass Jacobs, and Pradip K. Srimani. Linear time self-stabilizing colorings. Inf. Process. Lett., 87(5):251-255, 2003.
-
(2003)
Inf. Process. Lett
, vol.87
, Issue.5
, pp. 251-255
-
-
Hedetniemi, S.T.1
Pokrass Jacobs, D.2
Srimani, P.K.3
-
17
-
-
0002792857
-
A self-stabilizing algorithm for maximal matching
-
Su-Chu Hsu and Shing-Tsaan Huang. A self-stabilizing algorithm for maximal matching. Inf. Process. Lett., 43(2):77-81, 1992.
-
(1992)
Inf. Process. Lett
, vol.43
, Issue.2
, pp. 77-81
-
-
Hsu, S.1
Huang, S.2
-
18
-
-
0036443139
-
Self-stabilizing local mutual exclusion on networks in which process identifiers are not distinct
-
Hirotsugu Kakugawa and Masafumi Yamashita. Self-stabilizing local mutual exclusion on networks in which process identifiers are not distinct. In SRDS, pages 202-211, 2002.
-
(2002)
SRDS
, pp. 202-211
-
-
Kakugawa, H.1
Yamashita, M.2
-
19
-
-
0035303619
-
Self-stabilizing strong fairness under weak fairness
-
Mehmet Hakan Karaata. Self-stabilizing strong fairness under weak fairness. IEEE Trans. Parallel Distrib. Syst., 12(4):337-345, 2001.
-
(2001)
IEEE Trans. Parallel Distrib. Syst
, vol.12
, Issue.4
, pp. 337-345
-
-
Hakan Karaata, M.1
-
20
-
-
33845540109
-
A memory efficient self-stabilizing algorithm for maximal repacking
-
Self-stabilizing Systems, Safety, and Security, of, Dallas, Texas, November, Springer Verlag
-
Fredrik Manne and Morten Mjolde. A memory efficient self-stabilizing algorithm for maximal repacking. In Self-stabilizing Systems, Safety, and Security, volume 4280 of Lecture Notes in Computer Science, Dallas, Texas, November 2006. Springer Verlag.
-
(2006)
Lecture Notes in Computer Science
, vol.4280
-
-
Manne, F.1
Mjolde, M.2
-
21
-
-
0036443284
-
-
Mikhail Nesterenko and Anish Arora. Tolerance to unbounded byzantine faults. In SRDS, pages 22-, IEEE Computer Society, 2002.
-
Mikhail Nesterenko and Anish Arora. Tolerance to unbounded byzantine faults. In SRDS, pages 22-, IEEE Computer Society, 2002.
-
-
-
|