The following pages link to A Problem with Telephones (Q3964600):
Displayed 32 items.
- Toward optimal gossiping schemes with conference calls (Q787168) (← links)
- A class of solutions to the gossip problem. III (Q791539) (← links)
- Label-connected graphs and the gossip problem (Q804593) (← 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)
- Communication complexity of fault-tolerant information diffusion (Q1274923) (← links)
- Graph theoretical issues in computer networks (Q1319540) (← links)
- Better bounds for perpetual gossiping (Q1363648) (← links)
- The epistemic gossip problem (Q1712508) (← links)
- Kernels of minimum size gossip schemes (Q1897431) (← links)
- The partial gossiping problem (Q1910536) (← links)
- Reordered gossip schemes (Q1923510) (← links)
- Propositional gossip protocols (Q2140515) (← links)
- The logic of gossiping (Q2211849) (← links)
- Lossy gossip and composition of metrics (Q2351025) (← links)
- Information flows on hypergraphs (Q2366011) (← links)
- Dynamic gossip (Q2415893) (← links)
- Minimal number of calls in propositional protocols (Q2695494) (← 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)
- Telephone Problems with Failures (Q3699732) (← links)
- Gossiping without Duplicate Transmissions (Q3960730) (← links)
- (Q5015383) (← links)
- Connectivity and inference problems for temporal networks (Q5894823) (← links)
- Broadcasting in weighted trees under the postal model (Q5964023) (← links)
- Sharp Thresholds in Random Simple Temporal Graphs (Q6131198) (← links)
- Invited paper: Simple, strict, proper, happy: a study of reachability in temporal graphs (Q6155232) (← links)