Randomized Rumor Spreading Revisited
暂无分享,去创建一个
[1] Hadas Shachnai,et al. Fast information spreading in graphs with large weak conductance , 2011, SODA '11.
[2] B. Pittel. On spreading a rumor , 1987 .
[3] Mahmoud Fouz,et al. Social networks spread rumors in sublogarithmic time , 2011, STOC '11.
[4] Silvio Lattanzi,et al. Rumor spreading in social networks , 2011, Theor. Comput. Sci..
[5] Eli Upfal,et al. Randomized Broadcast in Networks , 1990, Random Struct. Algorithms.
[6] Doug Terry,et al. Epidemic algorithms for replicated database maintenance , 1988, OPSR.
[7] Silvio Lattanzi,et al. Almost tight bounds for rumour spreading with conductance , 2010, STOC '10.
[8] Alan M. Frieze,et al. The shortest-path problem for graphs with random arc-lengths , 1985, Discret. Appl. Math..
[9] Marvin Künnemann,et al. Tight Analysis of Randomized Rumor Spreading in Complete Graphs , 2014, ANALCO.
[10] Devavrat Shah,et al. Fast Distributed Algorithms for Computing Separable Functions , 2005, IEEE Transactions on Information Theory.
[11] Richard M. Karp,et al. Randomized rumor spreading , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[12] Amin Saberi,et al. On the spread of viruses on the internet , 2005, SODA '05.
[13] Calvin C. Newport,et al. How to Discreetly Spread a Rumor in a Crowd , 2016, DISC.
[14] Petar Maymounkov,et al. Global computation in a poorly connected world: fast rumor spreading with no dependence on conductance , 2011, STOC '12.
[15] Valerio Schiavoni,et al. BRISA: Combining Efficiency and Reliability in Epidemic Data Dissemination , 2012, 2012 IEEE 26th International Parallel and Distributed Processing Symposium.
[16] Andrea E. F. Clementi,et al. Rumor Spreading in Random Evolving Graphs , 2013, ESA.
[17] Hadas Shachnai,et al. Partial information spreading with application to distributed maximum coverage , 2010, PODC.
[18] Marcos Kiwi,et al. FIFO Queues Are Bad for Rumor Spreading , 2017, IEEE Transactions on Information Theory.
[19] Konstantinos Panagiotou,et al. Reliable Broadcasting in Random Networks and the Effect of Density , 2010, 2010 Proceedings IEEE INFOCOM.
[20] Thomas Sauerwald,et al. Faster Rumor Spreading With Multiple Calls , 2013, Electron. J. Comb..
[21] Thomas Sauerwald,et al. Ultra-fast rumor spreading in social networks , 2012, SODA.
[22] George Giakkoupis,et al. Tight bounds for rumor spreading in graphs of a given conductance , 2011, STACS.
[23] Konrad Iwanicki,et al. Gossip-Based Self-Management of a Recursive Area Hierarchy for Large Wireless SensorNets , 2010, IEEE Transactions on Parallel and Distributed Systems.
[24] George Giakkoupis. Tight Bounds for Rumor Spreading with Vertex Expansion , 2014, SODA.
[25] Anna Huber,et al. Strong robustness of randomized rumor spreading protocols , 2013, Discret. Appl. Math..