Leader Election in Complete Networks
From MaRDI portal
Publication:4337660
DOI10.1137/S0097539794276865zbMATH Open0870.68079OpenAlexW1973013791MaRDI QIDQ4337660FDOQ4337660
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
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+\log n)\) time with messages of size \(O(1)\)
- Efficient leader election using sense of direction
Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15) Theory of operating systems (68N25)
Cited In (15)
- Title not available (Why is that?)
- Leader election in complete networks
- Leader election in SINR model with arbitrary power control
- How to elect a leader faster than a tournament
- Deterministic leader election in \(O(D+\log n)\) time with messages of size \(O(1)\)
- Real-time leader election
- Efficient leader election using sense of direction
- Fast protocols for leader election and spanning tree construction in a distributed network
- Singularly optimal randomized leader election
- A Theoretical Study of Different Leader Roles in Networks
- On a game in directed graphs.
- Survivors in Leader Election Algorithms
- Title not available (Why is that?)
- Leader election in the presence of n-1 initial failures
- On the Complexity of Universal 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)
