Tight Bounds for Quasirandom Rumor Spreading
暂无分享,去创建一个
Konstantinos Panagiotou | Anna Huber | Benjamin Doerr | Spyros Angelopoulos | Benjamin Doerr | K. Panagiotou | Spyros Angelopoulos | Anna Huber
[1] Dhar,et al. Eulerian Walkers as a Model of Self-Organized Criticality. , 1996, Physical review letters.
[2] ANNA HUBER. QUASIRANDOM RUMOUR SPREADING ON THE COMPLETE GRAPH IS AS FAST AS RANDOMIZED RUMOUR SPREADING , 2009 .
[3] Anna Huber,et al. Quasirandom Rumor Spreading on the Complete Graph Is as Fast as Randomized Rumor Spreading , 2009, SIAM J. Discret. Math..
[4] B. Pittel. On spreading a rumor , 1987 .
[5] Joshua N. Cooper,et al. Deterministic random walks on the integers , 2007, Eur. J. Comb..
[6] Tobias Friedrich,et al. Deterministic Random Walks on the Two-Dimensional Grid , 2009, Comb. Probab. Comput..
[7] Alan M. Frieze,et al. The shortest-path problem for graphs with random arc-lengths , 1985, Discret. Appl. Math..
[8] Joshua N. Cooper,et al. Simulating a Random Walk with Constant Error , 2004, Combinatorics, Probability and Computing.
[9] Herbert W. Hethcote,et al. The Mathematics of Infectious Diseases , 2000, SIAM Rev..
[10] Colin McDiarmid,et al. Surveys in Combinatorics, 1989: On the method of bounded differences , 1989 .
[11] Eli Upfal,et al. Randomized Broadcast in Networks , 1990, Random Struct. Algorithms.
[12] Harald Niederreiter,et al. Random number generation and Quasi-Monte Carlo methods , 1992, CBMS-NSF regional conference series in applied mathematics.
[13] Joshua N. Cooper,et al. Deterministic random walks on regular trees , 2008, SODA '08.
[14] Scott Shenker,et al. Epidemic algorithms for replicated database maintenance , 1988, OPSR.
[15] Thomas Sauerwald,et al. Quasirandom rumor spreading , 2008, SODA '08.
[16] Thomas Sauerwald,et al. Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs , 2007, STACS.
[17] John E. Hopcroft,et al. Correctness of a gossip based membership protocol , 2005, PODC '05.