Algorithms - ESA 2003

DOI10.1007/B13632zbMATH Open1266.68032OpenAlexW1827234103MaRDI QIDQ5897261FDOQ5897261

Authors: Samir Khuller, Yoo-Ah Kim, Yung-Chun Justin Wan 

Publication date: 3 March 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b13632

Recommendations

• On generalized gossiping and broadcasting
• On the optimality of general lower bounds for broadcasting and gossiping
• A survey of gossiping and broadcasting in communication networks
• Verifiable broadcasting and gossiping in communication networks
• Gossiping for communication-efficient broadcast
• scientific article; zbMATH DE number 2089989
• Broadcasting and Gossiping in de Bruijn Networks
• Gossiping and broadcasting versus computing functions in networks
• Fault-tolerant broadcasting and gossiping in communication networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12)

Cited In (7)

• The epistemic gossip problem
• Broadcasting and Gossiping in de Bruijn Networks
• On generalized gossiping and broadcasting
• A Generalized Gossip Algorithm on Convex Metric Spaces
• A lightweight epistemic logic and its application to planning
• Generalised gossip-based subgradient method for distributed optimisation
• Improved approximation algorithms for data migration

This page was built for publication: Algorithms - ESA 2003

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