Gossips and telephones

DOI10.1016/0012-365X(72)90001-5MaRDI QIDQ2555073zbMATH OpenFDO

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

(44)

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

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)