Distance- k knowledge in self-stabilizing algorithms-Reference-Cited by-同舟云学术

Distance- k knowledge in self-stabilizing algorithms

Published:2008-06 Issue:1-2 Volume:399 Page:118-127
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Goddard Wayne,Hedetniemi Stephen T.,Jacobs David P.,Trevisan Vilmar

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference12 articles.

1. J. Beauquier, S. Cordier, S. Delaët, Optimum probabilistic self-stabilization on uniform rings, in: Proceedings of the Second Workshop on Self-Stabilizing Systems, 1995, pp. 15.1–15.15

2. When graph theory helps self-stabilization;Boulinier,2004

3. Token based group mutual exclusion for asynchronous rings;Cantarell,2001

4. Self-stabilizing philosophers with generic conflicts;Danturi,2006

5. Self-stabilizing systems in spite of distributed control;Dijkstra;Comm. ACM,1974

Cited by 27 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A self‐stabilizing distributed algorithm for the 1‐MIS problem under the distance‐3 model;Concurrency and Computation: Practice and Experience;2024-09-09

2. A self-stabilizing distributed algorithm for the 1-MIS problem under the distance-3 model;2023 Eleventh International Symposium on Computing and Networking Workshops (CANDARW);2023-11-27

3. A self‐stabilizing distributed algorithm for the bounded lattice domination problems under the distance‐2 model;Concurrency and Computation: Practice and Experience;2023-09-11

4. A fast approximation algorithm for the maximum 2-packing set problem on planar graphs;Optimization Letters;2022-10-11

5. An O(n2) Self-Stabilizing Algorithm for Minimal Total Dominating Set in Arbitrary Graphs;2020 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT);2020-12