scientific article; zbMATH DE number 1796990

MaRDI QIDQ4551385zbMATH OpenFDO

Authors Marek Chrobak, Leszek Gąsieniec, Wojciech Rytter

Publication date 5 September 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2108/21080483

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Randomized algorithms (68W20)

Recommendations

• A randomized algorithm for gossiping in radio networks
• scientific article; zbMATH DE number 2089989
• An \(O(n^{1.5})\) deterministic gossiping algorithm for radio networks
• Broadcasting algorithms in radio networks with unknown topology
• Fast broadcasting and gossiping in radio networks

Cited in

(13)

• Energy efficient randomised communication in unknown AdHoc networks
• An \(O(n^{1.5})\) deterministic gossiping algorithm for radio networks
• On adaptive deterministic gossiping in ad hoc radio networks.
• Asymptotically optimal gossiping in radio networks
• Time efficient centralized gossiping in radio networks
• On Efficient Gossiping in Radio Networks
• Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults
• Quantitative analysis under fairness constraints
• Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks
• A randomized algorithm for gossiping in radio networks
• scientific article; zbMATH DE number 2089989 (Why is no real title available?)
• Structural Information and Communication Complexity
• Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4551385)