Making distributed spanning tree algorithms fault-resilient
- 31 January 2006
- book chapter
- Published by Springer Nature
- p. 432-444
- https://doi.org/10.1007/bfb0039625
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985
- A modular technique for the design of efficient distributed leader finding algorithmsPublished by Association for Computing Machinery (ACM) ,1985
- Easy impossibility proofs for distributed consensus problemsPublished by Association for Computing Machinery (ACM) ,1985
- Time and message bounds for election in synchronous and asynchronous complete networksPublished by Association for Computing Machinery (ACM) ,1985
- Elections in the presence of faultsPublished by Association for Computing Machinery (ACM) ,1984
- The consensus problem in unreliable distributed systems (a brief survey)Lecture Notes in Computer Science, 1983
- A Distributed Algorithm for Minimum-Weight Spanning TreesACM Transactions on Programming Languages and Systems, 1983
- Elections in a Distributed Computing SystemIEEE Transactions on Computers, 1982
- Decentralized extrema-finding in circular configurations of processorsCommunications of the ACM, 1980
- Corrigendum: “Distributed Termination”ACM Transactions on Programming Languages and Systems, 1980