Author:
Guellati Nabil,Kheddouci Hamamache
Subject
Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software
Reference69 articles.
1. Self-stabilizing algorithms for finding centers and medians of trees;Bruell;SIAM Journal on Computing,1999
2. S. Cantarell, A.K. Datta, F. Petit, Self-stabilizing atomicity refinement allowing neighborhood concurrency, in: Proc. 6th International Symposium on Self-Stabilizing Systems, 2003, pp. 102–112
3. S. Chattopadhyay, L. Higham, K. Seyffarth, Dynamic and self-stabilizing distributed matching, in: Proc. 21st ACM Symposium on Principles of Distributed Computing, 2002, pp. 290–297
4. P. Chaudhuri, H. Thompson, A self-stabilizing algorithm for L(2,1)-labeling trees, in: Proc. IASTED International Conference on Parallel and Distributed Computing and Networks, 2005, pp. 627–632
5. A self-stabilizing O(k)-time k-clustering algorithm;Datta;Computer Journal,2009
Cited by
62 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献