Pages that link to "Item:Q5137335"
From MaRDI portal
The following pages link to Lower bounds for the broadcast problem in mobile radio networks (Q5137335):
Displaying 35 items.
- Information dissemination in unknown radio networks with large labels (Q391755) (← links)
- Energy-efficient broadcasting in ad hoc wireless networks (Q511146) (← links)
- Improved lower bound for deterministic broadcasting in radio networks (Q551181) (← links)
- The impact of mobility on the geocasting problem in mobile ad-hoc networks: solvability and cost (Q631767) (← links)
- Acknowledged broadcasting and gossiping in ad hoc radio networks (Q884460) (← links)
- Broadcasting in geometric radio networks (Q924558) (← links)
- Fast radio broadcasting with advice (Q962160) (← links)
- Acknowledged broadcasting in ad hoc radio networks (Q975548) (← links)
- A lower bound for radio broadcast (Q1176103) (← links)
- Distributed broadcast in radio networks of unknown topology. (Q1401336) (← links)
- Faster broadcasting in unknown radio networks (Q1603436) (← links)
- Information gathering in ad-hoc radio networks with tree topology (Q1686117) (← links)
- Faster information gathering in ad-hoc radio tree networks (Q1742375) (← links)
- Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism (Q1770372) (← links)
- Information gathering in ad-hoc radio networks (Q2051793) (← links)
- Broadcasting in UDG radio networks with unknown topology (Q2377263) (← links)
- Round complexity of leader election and gossiping in bidirectional radio networks (Q2450927) (← links)
- On the communication complexity of Bar-Yehuda, Goldreich and Itai's randomized broadcasting algorithm (Q2457303) (← links)
- Radio communication in random graphs (Q2495397) (← links)
- Deterministic M2M multicast in radio networks (Q2508975) (← links)
- Broadcast Abstraction in a Stochastic Calculus for Mobile Networks (Q2915180) (← links)
- Time-Efficient Broadcast in Radio Networks (Q3404475) (← links)
- Fast Radio Broadcasting with Advice (Q3511406) (← links)
- Lower Bounds for Clear Transmissions in Radio Networks (Q3525780) (← links)
- On Radio Broadcasting in Random Geometric Graphs (Q3540232) (← links)
- Broadcasting in UDG Radio Networks with Missing and Inaccurate Information (Q3540235) (← links)
- Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges (Q3540236) (← links)
- Lower Bounds for the Noisy Broadcast Problem (Q3549324) (← links)
- (Q5005184) (← links)
- Deterministic broadcasting in ad hoc radio networks (Q5138368) (← links)
- STACS 2004 (Q5309729) (← links)
- Sensor Network Gossiping or How to Break the Broadcast Lower Bound (Q5387760) (← links)
- Radio Network Lower Bounds Made Easy (Q5498700) (← links)
- Token traversal in ad hoc wireless networks via implicit carrier sensing (Q5919418) (← links)
- On the effect of the deployment setting on broadcasting in Euclidean radio networks (Q5919816) (← links)
