Exponential Separations in the Energy Complexity of Leader Election
From MaRDI portal
Publication:4973045
DOI10.1145/3341111zbMATH Open1454.68015OpenAlexW2979827763WikidataQ115522533 ScholiaQ115522533MaRDI QIDQ4973045FDOQ4973045
Authors: Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie, Ruosong Wang, Wei Zhan 
Publication date: 2 December 2019
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3341111
Recommendations
- Exponential separations in the energy complexity of leader election
- Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election
- Asymptotic properties of a leader election algorithm
- The complexity of leader election in diameter-two networks
- Asymptotic analysis of a leader election algorithm
- Asymptotic and numerical studies of the leader election algorithm
- Sublinear bounds for randomized leader election
- Sublinear bounds for randomized leader election
- On space and time complexity of loosely-stabilizing leader election
- On the distribution for the duration of a randomized leader election algorithm
Randomized algorithms (68W20) Analysis of algorithms (68W40) Distributed algorithms (68W15) Distributed systems (68M14)
Cited In (7)
- Efficient and competitive broadcast in multi-channel radio networks
- Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election
- Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics
- Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks
- Distributed MIS in O(log log n) Awake Complexity
- Transmitting once to elect a leader on wireless networks
- Node and edge averaged complexities of local graph problems
This page was built for publication: Exponential Separations in the Energy Complexity of Leader Election
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4973045)
