Gossips and telephones
From MaRDI portal
Publication:2555073
DOI10.1016/0012-365X(72)90001-5zbMath0245.05002MaRDI QIDQ2555073
Brenda S. Baker, Robert E. Shostak
Publication date: 1972
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (44)
Gossiping without Duplicate Transmissions ⋮ Telephone Problems with Failures ⋮ A Problem with Telephones ⋮ Quick gossiping without duplicate transmissions ⋮ Optimal algorithms for dissemination of information in generalized communication modes ⋮ Note on optimal gossiping in some weak-connected graphs ⋮ A Poor Man’s Epistemic Logic Based on Propositional Assignment and Higher-Order Observation ⋮ The structure of information networks ⋮ An Introduction to Temporal Graphs: An Algorithmic Perspective ⋮ The partial gossiping problem ⋮ Everyone knows that everyone knows ⋮ NP-Completeness in the gossip monoid ⋮ Reordered gossip schemes ⋮ Dynamic gossip ⋮ Efficient and incentive compatible exchange of real-time information ⋮ Further gossip problems ⋮ Efficient Communication by Phone Calls ⋮ Unnamed Item ⋮ The logic of gossiping ⋮ The epistemic gossip problem ⋮ A class of solutions to the gossip problem. I ⋮ On linear-time data dissemination in dynamic rooted trees ⋮ A decentralized model of information pricing in networks ⋮ Possible Worlds Semantics Based on Observation and Communication ⋮ Connectivity and inference problems for temporal networks ⋮ A lightweight epistemic logic and its application to planning ⋮ On Gossiping with Faulty Telephone Lines ⋮ Set to set broadcasting in communication networks ⋮ Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs ⋮ New gossips and telephones ⋮ The communication problem on graphs ⋮ Broadcasting in weighted trees under the postal model ⋮ Gossips and telegraphs ⋮ Optimal algorithms for dissemination of information in some interconnection networks ⋮ Communication complexity of fault-tolerant information diffusion ⋮ Improved Bounds for Minimum Fault-Tolerant Gossip Graphs ⋮ The gossip problem ⋮ Corrigendum to: ``Note on the gossip problem ⋮ Toward optimal gossiping schemes with conference calls ⋮ Gossiping old ladies ⋮ The number of rounds needed to exchange information within a graph ⋮ An Introduction to Temporal Graphs: An Algorithmic Perspective* ⋮ Verifiable broadcasting and gossiping in communication networks ⋮ Lossy gossip and composition of metrics
Cites Work
This page was built for publication: Gossips and telephones
