scientific article; zbMATH DE number 3990855

MaRDI QIDQ3753476zbMATH OpenFDO

Authors Shay Kutten, Yaron Wolfstahl, Shmuel Zaks, Reuven Bar-Yehuda

Publication date 1987

zbMATH Keywords

distributed algorithmsamortized message complexityfault-resilient algorithmsmultiple-token algorithms

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Recommendations

• scientific article; zbMATH DE number 4058884
• Distributed algorithms for low stretch spanning trees
• A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph
• Distributed Tree Rearrangements for Reachability and Robust Connectivity
• Distributed Tree Rearrangements for Reachability and Robust Connectivity
• A fully distributed (minimal) spanning tree algorithm
• scientific article; zbMATH DE number 1760042
• Fault-tolerant tree-based multicasting in mesh multicomputers

Cited in

(8)

• Distributed search trees: fault tolerance in an asynchronous environment
• Distributed Tree Rearrangements for Reachability and Robust Connectivity
• Possibility and impossibility results in a shared memory environment
• Making fault-sensitive algorithms tolerate link failures
• Initial failures in distributed computations
• The multi-tree approach to reliability in distributed networks
• Leader election in the presence of n-1 initial failures
• A strongly-stabilizing protocol for spanning tree construction against a mobile Byzantine fault

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3753476)