Gossips and telephones

DOI10.1016/0012-365X(72)90001-5zbMATH Open0245.05002MaRDI QIDQ2555073FDOQ2555073

Authors: Brenda S. Baker, Robert E. Shostak 

Publication date: 1972

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Cites Work

• A Cure for the Telephone Disease

Cited In (45)

• Minimum linear gossip graphs and maximal linear \((\Delta,k)\)-gossip graphs
• Verifiable broadcasting and gossiping in communication networks
• Improved bounds for minimum fault-tolerant gossip graphs
• On linear-time data dissemination in dynamic rooted trees
• The epistemic gossip problem
• Dynamic gossip
• A decentralized model of information pricing in networks
• A poor man's epistemic logic based on propositional assignment and higher-order observation
• On Gossiping with Faulty Telephone Lines
• The gossip problem
• NP-completeness in the gossip monoid
• Possible worlds semantics based on observation and communication
• Communication complexity of fault-tolerant information diffusion
• Note on optimal gossiping in some weak-connected graphs
• The logic of gossiping
• Lossy gossip and composition of metrics
• Connectivity and inference problems for temporal networks
• Reordered gossip schemes
• A Problem with Telephones
• New gossips and telephones
• Efficient Communication by Phone Calls
• Temporally connected components
• Optimal algorithms for dissemination of information in some interconnection networks
• Gossiping without Duplicate Transmissions
• Everyone knows that everyone knows
• An introduction to temporal graphs: an algorithmic perspective
• An introduction to temporal graphs: an algorithmic perspective
• The structure of information networks
• Optimal algorithms for dissemination of information in generalized communication modes
• Title not available (Why is that?)
• A lightweight epistemic logic and its application to planning
• Toward optimal gossiping schemes with conference calls
• Gossips and telegraphs
• Gossiping old ladies
• The number of rounds needed to exchange information within a graph
• Further gossip problems
• The partial gossiping problem
• Telephone Problems with Failures
• Set to set broadcasting in communication networks
• A class of solutions to the gossip problem. I
• Broadcasting in weighted trees under the postal model
• Efficient and incentive compatible exchange of real-time information
• Corrigendum to: ``Note on the gossip problem
• The communication problem on graphs
• Quick gossiping without duplicate transmissions

This page was built for publication: Gossips and telephones

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