Author:
Goddard Wayne,Hedetniemi Stephen T.,Jacobs David P.,Srimani Pradip K.
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Gradinariu, M., Tixeuil, S.: Self-stabilizing vertex coloration of arbitary graphs. In: 4th International Conference On Principles Of DIstributed Systems, OPODIS 2000, pp. 55–70. Studia Informatica Universalis (2000)
2. Dolev, S., Welch, J.L.: Crash resilient communication in dynamic networks. IEEE Transactions on Computers 46, 14–26 (1997)
3. Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Communications of the ACM 17(11), 643–644 (1974)
4. Lamport, L.: Solved problems, unsolved problems, and non-problems in concurrency. In: Proceedings of the 3rd Annual ACM Symposium on Principles of Distributed Computing, pp. 1–11 (1984)
5. Schneider, M.: Self-stabilization. ACM Computing Surveys 25(1), 45–67 (1993)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Self-Stabilizing Domination Algorithms;Developments in Mathematics;2020-09-15
2. A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs;Journal of Parallel and Distributed Computing;2010-04
3. Self-Stabilizing Distributed Systems and Sensor Networks;Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks;2005-08-08