Silent self-stabilizing BFS tree algorithms revisited-Reference-Cited by-同舟云学术

Silent self-stabilizing BFS tree algorithms revisited

Published:2016-11 Issue: Volume:97 Page:11-23
ISSN:0743-7315
Container-title:Journal of Parallel and Distributed Computing
language:en
Short-container-title:Journal of Parallel and Distributed Computing

Author:

Devismes Stéphane,Johnen Colette

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference28 articles.

1. Distributed reset;Arora;IEEE Trans. Comput.,1994

2. Cross-over composition—enforcement of fairness under unfair adversary;Beauquier,2001

3. On proof-labeling schemes versus silent self-stabilizing algorithms;Blin,2014

4. A. Bui, A.K. Datta, F. Petit, V. Villain, Optimal PIF in tree networks, in: The 2nd International Meeting on Distributed Data & Structures 2 WDAS 1999, 1999, pp. 1–16.

5. A uniform self-stabilizing minimum diameter tree algorithm (extended abstract);Butelle,1995

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

1. A Survey of Distributed Graph Algorithms on Massive Graphs;ACM Computing Surveys;2024-09-05

2. Asynchronous Self-stabilization Made Fast, Simple, and Energy-efficient;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17

3. Analysis of a memory-efficient self-stabilizing BFS spanning tree construction;Theoretical Computer Science;2023-04

4. Exploring Worst Cases of Self-stabilizing Algorithms Using Simulations;Lecture Notes in Computer Science;2023

5. A Self-stabilizing Minimum Average Stretch Spanning Tree Construction;Networked Systems;2022