Leader Election in Complete Networks

DOI10.1137/S0097539794276865MaRDI QIDQ4337660zbMATH OpenOpenAlexFDO

Authors Gurdip Singh

Publication date 26 May 1997

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539794276865

zbMATH Keywords

complete networksdistributed algorithmsleader electiontime complexity

Mathematics Subject Classification ID

Theory of operating systems (68N25) Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Recommendations

• Leader election in complete networks
• scientific article; zbMATH DE number 1759418
• Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks
• Deterministic leader election in O(D+ n) time with messages of size O(1)
• Efficient leader election using sense of direction

Cited in

(15)

• Real-time leader election
• Deterministic leader election in O(D+ n) time with messages of size O(1)
• Leader election in the presence of n-1 initial failures
• On a game in directed graphs.
• Fast protocols for leader election and spanning tree construction in a distributed network
• How to elect a leader faster than a tournament
• scientific article; zbMATH DE number 1759418 (Why is no real title available?)
• Efficient leader election using sense of direction
• scientific article; zbMATH DE number 6313182 (Why is no real title available?)
• Survivors in Leader Election Algorithms
• A Theoretical Study of Different Leader Roles in Networks
• Leader election in complete networks
• On the Complexity of Universal Leader Election
• Leader election in SINR model with arbitrary power control
• Singularly optimal randomized leader election

This page was built for publication: Leader Election in Complete Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337660)