The following pages link to Gossips and telephones (Q2555073):
Displaying 45 items.
- Toward optimal gossiping schemes with conference calls (Q787168) (← links)
- The structure of information networks (Q852336) (← links)
- Gossiping old ladies (Q1053683) (← links)
- The number of rounds needed to exchange information within a graph (Q1054746) (← links)
- Quick gossiping without duplicate transmissions (Q1080864) (← links)
- Further gossip problems (Q1144577) (← links)
- A class of solutions to the gossip problem. I (Q1170198) (← links)
- Set to set broadcasting in communication networks (Q1208457) (← links)
- New gossips and telephones (Q1217126) (← links)
- The communication problem on graphs (Q1217715) (← links)
- Gossips and telegraphs (Q1258315) (← links)
- Optimal algorithms for dissemination of information in some interconnection networks (Q1261287) (← links)
- Communication complexity of fault-tolerant information diffusion (Q1274923) (← links)
- Optimal algorithms for dissemination of information in generalized communication modes (Q1339882) (← links)
- Note on optimal gossiping in some weak-connected graphs (Q1342244) (← links)
- Verifiable broadcasting and gossiping in communication networks (Q1602698) (← links)
- The epistemic gossip problem (Q1712508) (← links)
- On linear-time data dissemination in dynamic rooted trees (Q1727754) (← links)
- The partial gossiping problem (Q1910536) (← links)
- Reordered gossip schemes (Q1923510) (← links)
- The logic of gossiping (Q2211849) (← links)
- A lightweight epistemic logic and its application to planning (Q2238679) (← links)
- Lossy gossip and composition of metrics (Q2351025) (← links)
- Dynamic gossip (Q2415893) (← links)
- Efficient and incentive compatible exchange of real-time information (Q2424242) (← links)
- A decentralized model of information pricing in networks (Q2455673) (← links)
- The gossip problem (Q2556403) (← links)
- Corrigendum to: ``Note on the gossip problem'' (Q2559375) (← links)
- Everyone knows that everyone knows (Q2658278) (← links)
- Minimum linear gossip graphs and maximal linear \((\Delta,k)\)-gossip graphs (Q2764998) (← links)
- On Gossiping with Faulty Telephone Lines (Q3029035) (← links)
- Improved Bounds for Minimum Fault-Tolerant Gossip Graphs (Q3104777) (← links)
- Possible Worlds Semantics Based on Observation and Communication (Q3299583) (← links)
- A Poor Man’s Epistemic Logic Based on Propositional Assignment and Higher-Order Observation (Q3457699) (← links)
- An Introduction to Temporal Graphs: An Algorithmic Perspective (Q3464477) (← links)
- Telephone Problems with Failures (Q3699732) (← links)
- Gossiping without Duplicate Transmissions (Q3960730) (← links)
- A Problem with Telephones (Q3964600) (← links)
- Efficient Communication by Phone Calls (Q4050597) (← links)
- NP-Completeness in the gossip monoid (Q4576008) (← links)
- (Q5015383) (← links)
- An Introduction to Temporal Graphs: An Algorithmic Perspective<sup>*</sup> (Q5856438) (← links)
- Connectivity and inference problems for temporal networks (Q5894823) (← links)
- Broadcasting in weighted trees under the postal model (Q5964023) (← links)
- Temporally connected components (Q6612544) (← links)
