The following pages link to STACS 2004 (Q5309729):
Displaying 12 items.
- Upper and lower bounds for deterministic broadcast in powerline communication networks (Q324622) (← links)
- Improved lower bound for deterministic broadcasting in radio networks (Q551181) (← links)
- Fast radio broadcasting with advice (Q962160) (← links)
- A note on the lower bound of centralized radio broadcasting for planar reachability graphs (Q1028487) (← links)
- A lower bound for radio broadcast (Q1176103) (← links)
- On the radius of nonsplit graphs and information dissemination in dynamic networks (Q2185751) (← links)
- Selective families, superimposed codes, and broadcasting on unknown radio networks. (Extended abstract) (Q2768369) (← links)
- Central limit theorem for time to broadcast in radio networks (Q2805321) (← links)
- A trade-off between information and communication in broadcast protocols (Q3474265) (← links)
- Fast Radio Broadcasting with Advice (Q3511406) (← links)
- Lower Bounds for Clear Transmissions in Radio Networks (Q3525780) (← links)
- Radio Network Lower Bounds Made Easy (Q5498700) (← links)
