The following pages link to A Cure for the Telephone Disease (Q5663914):
Displaying 36 items.
- Efficient broadcast trees for weighted vertices (Q516786) (← links)
- Toward optimal gossiping schemes with conference calls (Q787168) (← 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)
- A class of solutions to the gossip problem. I (Q1170198) (← links)
- Set to set broadcasting in communication networks (Q1208457) (← 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)
- Methods and problems of communication in usual networks (Q1339884) (← links)
- Note on optimal gossiping in some weak-connected graphs (Q1342244) (← links)
- The epistemic gossip problem (Q1712508) (← 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)
- Gossips and telephones (Q2555073) (← links)
- Minimum linear gossip graphs and maximal linear (?,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)
- Telephone Problems with Failures (Q3699732) (← links)
- A survey of gossiping and broadcasting in communication networks (Q3795460) (← links)
- A Problem with Telephones (Q3964600) (← links)
- Tighter time bounds on fault-tolerant broadcasting and gossiping (Q4014613) (← links)
- NP-Completeness in the gossip monoid (Q4576008) (← links)
- (Q5015383) (← links)
- Multicommodity Multicast, Wireless and Fast (Q5075826) (← links)
- Optimal orientations of vertex-multiplications of cartesian products of graphs (Q5863478) (← links)
- Connectivity and inference problems for temporal networks (Q5894823) (← links)
- Partial Shuffles by Lazy Swaps (Q6069432) (← links)
