Time vs. Information Tradeoffs for Leader Election in Anonymous Trees
ACM TRANSACTIONS ON ALGORITHMS, 2017.
Advicedeterministic distributed algorithmleader electiontimetrees
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
Full Text (Upload PDF)
PPT (Upload PPT)