scientific article; zbMATH DE number 2119728

MaRDI QIDQ4829002zbMATH OpenFDO

Authors Leszek Gąsieniec, Andrzej Lingas

Publication date 29 November 2004

zbMATH Keywords

gossiping algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68M99)

Recommendations

• On adaptive deterministic gossiping in ad hoc radio networks.
• An \(O(n^{1.5})\) deterministic gossiping algorithm for radio networks
• Structural Information and Communication Complexity
• Algorithm Theory - SWAT 2004
• scientific article; zbMATH DE number 2086637

Cited in

(12)

• Algorithm Theory - SWAT 2004
• scientific article; zbMATH DE number 2086637 (Why is no real title available?)
• An \(O(n^{1.5})\) deterministic gossiping algorithm for radio networks
• Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks
• On adaptive deterministic gossiping in ad hoc radio networks.
• Distributed Computing - IWDC 2004
• Deterministic communication in radio networks with large labels
• Gossiping in a Multi-channel Radio Network
• Principles of Distributed Systems
• Local gossip and neighbour discovery in mobile ad hoc radio networks
• Efficient distributed communication in ad-hoc radio networks
• scientific article; zbMATH DE number 1947418 (Why is no real title available?)

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 Q4829002)