Pages that link to "Item:Q5855245"
From MaRDI portal
The following pages link to The Energy Complexity of BFS in Radio Networks (Q5855245):
Displayed 10 items.
- Efficient and competitive broadcast in multi-channel radio networks (Q2105449) (← links)
- Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election (Q6052028) (← links)
- Node and edge averaged complexities of local graph problems (Q6071120) (← links)
- Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics (Q6076330) (← links)
- Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks (Q6096038) (← links)
- The energy complexity of diameter and minimum cut computation in bounded-genus networks (Q6148068) (← links)
- The energy complexity of diameter and minimum cut computation in bounded-genus networks (Q6199403) (← links)
- The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs (Q6202219) (← links)
- Distributed MIS in O(log log n) Awake Complexity (Q6202235) (← links)
- Distributed MIS with Low Energy and Time Complexities (Q6202237) (← links)