Exponential Separations in the Energy Complexity of Leader Election
From MaRDI portal
(Redirected from Publication:4973045)
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
- On space and time complexity of loosely-stabilizing leader election
- On the distribution for the duration of a randomized leader election algorithm
Cited in
(13)- Transmitting once to elect a leader on wireless networks
- Efficient and competitive broadcast in multi-channel radio networks
- Exponential separations in the energy complexity of leader election
- The energy complexity of broadcast
- Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election
- Node and edge averaged complexities of local graph problems
- Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics
- Transmitting once to elect a leader on wireless networks
- Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks
- Distributed MIS in O(log log n) Awake Complexity
- Jamming-resistant backoff with polylogarithmic sending and listening cost
- Fully energy-efficient randomized backoff: slow feedback loops yield fast contention resolution
- Distributed MIS in O( n) awake complexity
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)
