scientific article; zbMATH DE number 3358479
From MaRDI portal
Publication:5632576
zbMath0226.05001MaRDI QIDQ5632576
Publication date: 1971
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Telephone Problems with Failures ⋮ A Problem with Telephones ⋮ Quick gossiping without duplicate transmissions ⋮ Propositional gossip protocols ⋮ The partial gossiping problem ⋮ Everyone knows that everyone knows ⋮ NP-Completeness in the gossip monoid ⋮ Dynamic gossip ⋮ The limits to gossip: second-order shared knowledge of all secrets is unsatisfiable ⋮ Minimal number of calls in propositional protocols ⋮ Unnamed Item ⋮ The logic of gossiping ⋮ The epistemic gossip problem ⋮ Unnamed Item ⋮ A class of solutions to the gossip problem. I ⋮ Possible Worlds Semantics Based on Observation and Communication ⋮ Connectivity and inference problems for temporal networks ⋮ The Pleasure of Gossip ⋮ A lightweight epistemic logic and its application to planning ⋮ Epistemic protocols for dynamic gossip ⋮ On Gossiping with Faulty Telephone Lines ⋮ Set to set broadcasting in communication networks ⋮ The communication problem on graphs ⋮ Gossips and telegraphs ⋮ Improved Bounds for Minimum Fault-Tolerant Gossip Graphs ⋮ Toward optimal gossiping schemes with conference calls ⋮ Gossiping old ladies ⋮ The number of rounds needed to exchange information within a graph ⋮ Lossy gossip and composition of metrics
