scientific article; zbMATH DE number 2119728

zbMATH Open1093.68618MaRDI QIDQ4829002FDOQ4829002

Authors: Leszek Gąsieniec, Andrzej Lingas 

Publication date: 29 November 2004

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

gossiping algorithms

Mathematics Subject Classification ID

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

Cited In (12)

• Title not available (Why is that?)
• An \(O(n^{1.5})\) deterministic gossiping algorithm for radio networks
• Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks
• Distributed Computing - IWDC 2004
• On adaptive deterministic gossiping in ad hoc radio networks.
• 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
• Title not available (Why is that?)
• Algorithm Theory - SWAT 2004

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)