Pages that link to "Item:Q5170865"
From MaRDI portal
The following pages link to Efficient algorithms for leader election in radio networks (Q5170865):
Displaying 28 items.
- Leader election in ad hoc radio networks: a keen ear helps (Q394338) (← links)
- Communication and energy efficient routing protocols for single-hop radio networks (Q433469) (← links)
- Knowledge, level of symmetry, and time of leader election (Q498667) (← links)
- Randomized mutual exclusion on a multiple access channel (Q518923) (← links)
- Energy efficient alert in single-hop networks of extremely weak devices (Q714773) (← links)
- Quasi-optimal energy-efficient leader election algorithms in radio networks (Q879595) (← links)
- Impact of knowledge on election time in anonymous networks (Q1755789) (← links)
- Ordered and delayed adversaries and how to work against them on a shared channel (Q2010599) (← links)
- Leader election for anonymous asynchronous agents in arbitrary networks (Q2251147) (← links)
- Leader election in multi-hop radio networks (Q2326383) (← links)
- Performing work in broadcast networks (Q2375307) (← links)
- Message and time efficient multi-broadcast schemes (Q2513670) (← links)
- Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks (Q2729095) (← links)
- Energy-optimal algorithms for computing aggregative functions in random networks (Q2816512) (← links)
- Leader election in shared spectrum radio networks (Q2933797) (← links)
- Weak communication in single‐hop radio networks: adjusting algorithms to industrial standards (Q4432747) (← links)
- Exponential separations in the energy complexity of leader election (Q4978022) (← links)
- Local queuing under contention (Q5090920) (← links)
- Coordination Problems in Ad Hoc Radio Networks (Q5391120) (← links)
- Algorithms - ESA 2003 (Q5897263) (← links)
- Topology recognition and leader election in colored networks (Q5964025) (← links)
- Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election (Q6052028) (← links)
- Four shades of deterministic leader election in anonymous networks (Q6071119) (← links)
- Node and edge averaged complexities of local graph problems (Q6071120) (← links)
- Transmitting once to elect a leader on wireless networks (Q6077889) (← links)
- Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks (Q6096038) (← links)
- Restrained medium access control on adversarial shared channels (Q6133654) (← links)
- The energy complexity of diameter and minimum cut computation in bounded-genus networks (Q6199403) (← links)
