Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference14 articles.
1. Baker, B., Shostak, R.: Gossips and telephones. Discrete Math.2, 191–193 (1972)
2. Bermond, J.-C.: Le problem des “ouvoirs” (hypergraph gossip problem). In: Problemes Comb. et Theory des Graphs, edited by J.-C. Bermond. Paris: C.N.R.S. Colloq. 1976
3. Bumby, R.: A problem with telephones. SIAM J. Algebraic Discrete Methods2, 13–18 (1981)
4. Golumbic, M.: The general gossip problem. IBM Research Report (1974)
5. Hajnal, A., Milner, E., Szemerédi, E.: A cure for the telephone disease. Canad. Math. Bull.15, 447–450 (1972)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The logic of gossiping;Artificial Intelligence;2020-09
2. Epistemic Protocols for Distributed Gossiping;Electronic Proceedings in Theoretical Computer Science;2016-06-23
3. On general results for all-to-all broadcast;IEEE Transactions on Parallel and Distributed Systems;1996-04
4. Asymptotically optimal gossiping in radio networks;Discrete Applied Mathematics;1995-07
5. Optimal NODUP all-to-all broadcast schemes in distributed computing systems;IEEE Transactions on Parallel and Distributed Systems;1994