Efficient leader election using sense of direction

DOI10.1007/s004460050033zbMath1448.68164OpenAlexW2063026346MaRDI QIDQ5137338

Gurdip Singh

Publication date: 2 December 2020

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004460050033

zbMATH Keywords

distributed algorithmleader electioncomplete networksmessage complexity

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (5)

Computing on anonymous networks with sense of direction ⋮ Torus orientation ⋮ Sublinear bounds for randomized leader election ⋮ Symmetries and sense of direction in labeled graphs ⋮ Sense of direction in distributed computing

Cites Work

• Unnamed Item
• Towards optimal distributed election on chordal rings
• Efficient elections in chordal ring networks
• A near-optimal multistage distributed algorithm for finding leaders in clustered chordal rings
• Optimal lower bounds for some distributed algorithms for a complete network of processors

This page was built for publication: Efficient leader election using sense of direction