The epistemic gossip problem
Authors:
- Martin C. CooperMCMartin C. Cooper
- Andreas HerzigAHAndreas Herzig
- Faustine MaffreFMFaustine Maffre
- Frédéric MarisFMFrédéric Maris
- Pierre RégnierPRPierre Régnier
- 1 March 2019
- journal article
- research article
- Published by Elsevier in Discrete Mathematics
- Vol. 342 (3) , 654-663
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Epistemic protocols for dynamic gossipJournal of Applied Logic, 2017
- MANAGING TEMPORAL CYCLES IN PLANNING PROBLEMS REQUIRING CONCURRENCYComputational Intelligence, 2012
- Epidemic information dissemination in distributed systemsComputer, 2004
- Minimum linear gossip graphs and maximal linear (Δ, k)‐gossip graphsNetworks, 2001
- A study of minimum gossip graphsDiscrete Mathematics, 2000
- Hierarchical broadcast and gossip networksInformation Processing Letters, 2000
- The partial gossiping problemDiscrete Mathematics, 1996
- A Problem with TelephonesSIAM Journal on Algebraic Discrete Methods, 1981
- Gossips and telephonesDiscrete Mathematics, 1972
- Communication Patterns in Task-Oriented GroupsThe Journal of the Acoustical Society of America, 1950