Pages that link to "Item:Q1402221"
From MaRDI portal
The following pages link to An \(O(n^{1.5})\) deterministic gossiping algorithm for radio networks (Q1402221):
Displaying 14 items.
- Information dissemination in unknown radio networks with large labels (Q391755) (← links)
- Energy efficient randomised communication in unknown AdHoc networks (Q1029326) (← links)
- Information gathering in ad-hoc radio networks with tree topology (Q1686117) (← links)
- Faster information gathering in ad-hoc radio tree networks (Q1742375) (← links)
- On adaptive deterministic gossiping in ad hoc radio networks. (Q1853048) (← links)
- Information gathering in ad-hoc radio networks (Q2051793) (← links)
- Time efficient centralized gossiping in radio networks (Q2383602) (← links)
- Round complexity of leader election and gossiping in bidirectional radio networks (Q2450927) (← links)
- Deterministic M2M multicast in radio networks (Q2508975) (← links)
- On Efficient Gossiping in Radio Networks (Q3408156) (← links)
- Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults (Q3525590) (← links)
- A randomized algorithm for gossiping in radio networks (Q4458725) (← links)
- Structural Information and Communication Complexity (Q5315224) (← links)
- Algorithm Theory - SWAT 2004 (Q5315391) (← links)
