Faster deterministic communication in radio networks
From MaRDI portal
Publication:4598282
DOI10.4230/LIPICS.ICALP.2016.139zbMATH Open1387.68032OpenAlexW2412556971MaRDI QIDQ4598282FDOQ4598282
Authors: P. Davies, Artur Czumaj
Publication date: 19 December 2017
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/6283/pdf/LIPIcs-ICALP-2016-139.pdf/
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)
Cited In (11)
- Deterministic blind radio networks
- Faster communication in known topology radio networks
- On the complexity of distributed BFS in ad hoc networks with spontaneous wake-up
- A Faster Distributed Radio Broadcast Primitive
- Faster deterministic communication in radio networks
- On the complexity of neighbourhood learning in radio networks
- Oracle size, a new measure of difficulty for communication tasks
- Deterministic communication in radio networks
- Information gathering in ad-hoc radio networks with tree topology
- Faster information gathering in ad-hoc radio tree networks
- Information gathering in ad-hoc radio networks
This page was built for publication: Faster deterministic communication in radio networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598282)