Exponential Separations in the Energy Complexity of Leader Election
From MaRDI portal
Publication:4973045
DOI10.1145/3341111zbMath1454.68015WikidataQ115522533 ScholiaQ115522533MaRDI QIDQ4973045
Yi-Jun Chang, Wei Zhan, Tsvi Kopelowitz, Seth Pettie, Ruosong Wang
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
68W40: Analysis of algorithms
68M14: Distributed systems
68W20: Randomized algorithms
68W15: Distributed algorithms
Related Items
Transmitting once to elect a leader on wireless networks, 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, Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks, Distributed MIS in O(log log n) Awake Complexity, Efficient and competitive broadcast in multi-channel radio networks