The following pages link to Algorithm Theory - SWAT 2004 (Q5315391):
Displaying 17 items.
- Information dissemination in unknown radio networks with large labels (Q391755) (← links)
- Modeling radio networks (Q661053) (← links)
- Deterministic communication in radio networks with large labels (Q868440) (← links)
- Acknowledged broadcasting and gossiping in ad hoc radio networks (Q884460) (← links)
- Many-to-many communication in radio networks (Q1024217) (← links)
- Information gathering in ad-hoc radio networks with tree topology (Q1686117) (← links)
- Faster information gathering in ad-hoc radio tree networks (Q1742375) (← links)
- Information gathering in ad-hoc radio networks (Q2051793) (← links)
- Deterministic protocols in the SINR model without knowledge of coordinates (Q2208251) (← links)
- Fast message dissemination in random geometric networks (Q2375822) (← 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)
- Efficient Distributed Communication in Ad-Hoc Radio Networks (Q3012952) (← links)
- Time-Efficient Broadcast in Radio Networks (Q3404475) (← links)
- On Efficient Gossiping in Radio Networks (Q3408156) (← links)
- Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks (Q5387759) (← links)
