Order optimal information spreading using algebraic gossip-Reference-Cited by-同舟云学术

Order optimal information spreading using algebraic gossip

Published:2013-04 Issue:2 Volume:26 Page:99-117
ISSN:0178-2770
Container-title:Distributed Computing
language:en
Short-container-title:Distrib. Comput.

Author:

Avin Chen,Borokhovich Michael,Censor-Hillel Keren,Lotker Zvi

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00446-013-0187-y.pdf

Reference29 articles.

1. Angelopoulos, S., Doerr, B., Huber, A., Panagiotou, K.: Tight bounds for quasirandom rumor spreading. Electron. J. Comb. 16(1), R102,1–R102,19 (2009)

2. Borokhovich, M., Avin, C., Lotker, Z.: Tight bounds for algebraic gossip on graphs. In: 2010 IEEE International Symposium on Information Theory Proceedings (ISIT) (jun. 2010), pp. 1758–1762

3. Borokhovich, M., Avin, C., Lotker, Z.: Bounds for algebraic gossip on graphs. Random Structures & Algorithms (2012). doi: 10.1002/rsa.20480

4. Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Randomized gossip algorithms. IEEE Trans. Inf. Theory 52(6), 2508–2530 (2006)

5. Boyd, S.P., Ghosh, A., Prabhakar, B., Shah, D.: Gossip algorithms: design, analysis and applications. In: IEEE International Conference on Computer Communications (INFOCOM) (2005), pp. 1653–1664

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Latency and Alphabet Size in the Context of Multicast Network Coding;IEEE Transactions on Information Theory;2022-07

2. Distributed computation in dynamic networks via random walks;Theoretical Computer Science;2015-05

3. Network Coding Based Information Spreading in Dynamic Networks With Correlated Data;IEEE Journal on Selected Areas in Communications;2015-02