Leader election in the presence of link failures (abstract)

Authors:
Gurdip Singh
Affiliations:
Department of Computing and Information Sciences, 234 Nichols Hall, Kansas State University, Manhattan, Kansas
Venue:
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Year:
1994

Making distributed spanning tree algorithms fault-resilient

4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Fault-Tolerant Distributed Algorithm for Election in Complete Networks

IEEE Transactions on Computers - Fault-Tolerant Computing
Leader election in complete networks

PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Time and message bounds for election in synchronous and asynchronous complete networks

Proceedings of the fourth annual ACM symposium on Principles of distributed computing

Hi-index	0.00