Time vs. Information Tradeoffs for Leader Election in Anonymous Trees

SODA '16: Symposium on Discrete Algorithms Arlington Virginia January, 2016, pp. 600-609, 2017.

Cited by: 24|Bibtex|Views19|Links
EI

Abstract:

Leader election is one of the fundamental problems in distributed computing. It calls for all nodes of a network to agree on a single node, called the leader. If the nodes of the network have distinct labels, then agreeing on a single node means that all nodes have to output the label of the elected leader. If the nodes of the network are...More

Code:

Data:

Your rating :
0

 

Tags
Comments