Broadcast in the rendezvous model

DOI10.1016/J.IC.2006.01.002MaRDI QIDQ2495650zbMATH OpenOpenAlexFDO

Authors Philippe Duchon, Nicolas Hanusse, A. Zemmari, Nasser Saheb

Publication date 30 June 2006

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2006.01.002

zbMATH Keywords

algorithms and data structuresbroadcastdistributed algorithmsgraphrendezvous model

Mathematics Subject Classification ID

Data structures (68P05) Nonnumerical algorithms (68W05)

Recommendations

• STACS 2004
• Radio communication in random graphs
• Lower bounds for the broadcast problem in mobile radio networks
• Broadcasting in undirected ad hoc radio networks
• Broadcasting in undirected ad hoc radio networks

Cites work

• A survey of gossiping and broadcasting in communication networks
• Deterministic small-world communication networks
• Exploring Unknown Environments
• How to learn an unknown environment. I
• scientific article; zbMATH DE number 1246230 (Why is no real title available?)
• scientific article; zbMATH DE number 1552336 (Why is no real title available?)
• scientific article; zbMATH DE number 1857647 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Introduction to Distributed Algorithms
• Probabilistic methods for algorithmic discrete mathematics
• Randomized broadcast in networks
• Randomized local elections.

Cited in

(3)

• On linear-time data dissemination in dynamic rooted trees
• STACS 2004
• On handshakes in random graphs

This page was built for publication: Broadcast in the rendezvous model

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