Electing a leader in a synchronous ring
Journal of the ACM (JACM)
Telephone problems with failures
SIAM Journal on Algebraic and Discrete Methods
Electing a leader in a ring with link failures
Acta Informatica
Yet another distributed depth-first-search algorithm
Information Processing Letters
Optimal fault-tolerant distributed construction of a spanning forest
Information Processing Letters
Fault-Tolerant Distributed Algorithm for Election in Complete Networks
IEEE Transactions on Computers - Fault-Tolerant Computing
Fault tolerant distributed majority commitment
Journal of Algorithms
An efficient distributed depth-first-search algorithm
Information Processing Letters
On the number of rounds necessary to disseminate information
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Performance of Fault-Tolerant Diagnostics in the Hypercube Systems
IEEE Transactions on Computers
A modular technique for the design of efficient distributed leader finding algorithms
ACM Transactions on Programming Languages and Systems (TOPLAS)
A trade-off between information and communication in broadcast protocols
Journal of the ACM (JACM)
The consensus problem in fault-tolerant computing
ACM Computing Surveys (CSUR)
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Gossiping in a Distributed Network
IEEE Transactions on Computers
Distributed fault-tolerance for large multiprocessor systems
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
Graph Theory With Applications
Graph Theory With Applications
Reliable broadcasting in product networks with Byzantine faults
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
Broadcasting with locally bounded Byzantine faults
Information Processing Letters
Feasibility and complexity of broadcasting with random transmission failures
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Robust gossiping with an application to consensus
Journal of Computer and System Sciences
Feasibility and complexity of broadcasting with random transmission failures
Theoretical Computer Science
Deterministic Models of Communication Faults
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Rapid almost-complete broadcasting in faulty networks
Theoretical Computer Science
Broadcasting with locally bounded Byzantine faults
Information Processing Letters
Rapid almost-complete broadcasting in faulty networks
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Time and communication efficient consensus for crash failures
DISC'06 Proceedings of the 20th international conference on Distributed Computing
System-level fault diagnosis in fixed topology mobile ad hoc networks
International Journal of Communication Networks and Distributed Systems
| Hi-index | 14.98 |
Consider a network consisting of units connected by links in which some units could be faulty. Suppose each unit has a message which must be transmitted to all other (fault-free) units. We present an algorithm for doing this in a network operating in a fully distributed manner that requires at most 3n logn+O(n) message transmissions by fault-free units. Among other things, our result can be used to devise an algorithm for distributed system level diagnosis which is more efficient than the best currently known algorithm for this purpose.