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)

Full work available at URL https://doi.org/10.1016/0012-365X(72)90001-5

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Cites work

• A Cure for the Telephone Disease

Cited in

(49)

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

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)