Randomized protocols for information dissemination

[1]  Tobias Friedrich,et al.  Deterministic Random Walks on the Two-Dimensional Grid , 2009, Comb. Probab. Comput..

[2]  Elizabeth L. Wilmer,et al.  Markov Chains and Mixing Times , 2008 .

[3]  Thomas Sauerwald,et al.  The impact of randomization in smoothing networks , 2008, PODC '08.

[4]  Thomas Sauerwald,et al.  Self-stabilizing Cuts in Synchronous Networks , 2008, SIROCCO.

[5]  Thomas Sauerwald,et al.  A new diffusion-based multilevel algorithm for computing graph partitions of very high quality , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.

[6]  Thomas Sauerwald,et al.  The power of memory in randomized broadcasting , 2008, SODA '08.

[7]  Thomas Sauerwald,et al.  On Mixing and Edge Expansion Properties in Randomized Broadcasting , 2007, Algorithmica.

[8]  Joshua N. Cooper,et al.  Deterministic random walks on regular trees , 2008, SODA '08.

[9]  Noga Alon,et al.  Many random walks are faster than one , 2007, SPAA '08.

[10]  Andrzej Pelc,et al.  Communication in Networks with Random Dependent Faults , 2007, MFCS.

[11]  Chen Avin,et al.  On the cover time and mixing time of random geometric graphs , 2007, Theor. Comput. Sci..

[12]  Thomas Sauerwald,et al.  Agent-based randomized broadcasting in large networks , 2007, Discret. Appl. Math..

[13]  Joshua N. Cooper,et al.  Deterministic random walks on the integers , 2007, Eur. J. Comb..

[14]  Maurice Herlihy,et al.  The art of multiprocessor programming , 2020, PODC '06.

[15]  Thomas Sauerwald,et al.  Analyzing Disturbed Diffusion on Networks , 2006, ISAAC.

[16]  Thomas Sauerwald,et al.  On the runtime and robustness of randomized broadcasting , 2006, Theor. Comput. Sci..

[17]  Persi Diaconis,et al.  Separation cut-offs for birth and death chains , 2006, math/0702411.

[18]  Robert Elsässer,et al.  On the communication complexity of randomized broadcasting in random-like graphs , 2006, SPAA '06.

[19]  Stephen P. Boyd,et al.  Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.

[20]  Fan Chung Graham,et al.  Concentration Inequalities and Martingale Inequalities: A Survey , 2006, Internet Math..

[21]  Joshua N. Cooper,et al.  Simulating a Random Walk with Constant Error , 2004, Combinatorics, Probability and Computing.

[22]  Robert Elsässer,et al.  Distributing Unit Size Workload Packages in Heterogeneous Networks , 2006, J. Graph Algorithms Appl..

[23]  Guy Kortsarz,et al.  A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem , 2005, SIAM J. Comput..

[24]  Thomas Sauerwald,et al.  On randomized broadcasting in Star graphs , 2009, Discret. Appl. Math..

[25]  Omer Reingold,et al.  Undirected ST-connectivity in log-space , 2005, STOC '05.

[26]  Alan M. Frieze,et al.  The Cover Time of Random Regular Graphs , 2005, SIAM J. Discret. Math..

[27]  Amin Saberi,et al.  On the spread of viruses on the internet , 2005, SODA '05.

[28]  Thomas P. Hayes,et al.  Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group , 2005, SODA '05.

[29]  M. Mitzenmacher,et al.  Probability and Computing: Chernoff Bounds , 2005 .

[30]  Andrzej Pelc,et al.  Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance , 2005, Texts in Theoretical Computer Science. An EATCS Series.

[31]  Maurice Herlihy,et al.  Randomized smoothing networks , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[32]  Christian Scheideler,et al.  The Effect of Faults on Network Expansion , 2004, SPAA '04.

[33]  N. Alon,et al.  Percolation on finite graphs and isoperimetric inequalities , 2002, math/0207112.

[34]  D. Wilson.  Mixing times of lozenge tiling and card shuffling Markov chains , 2001, math/0102193.

[35]  Holger Arndt,et al.  Loadbalancing auf Parallelrechnern mit Hilfe endlicher Dimension-Exchange-Verfahren , 2003 .

[36]  Maurice Herlihy,et al.  Self-stabilizing smoothing and counting , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[37]  Peter Sarnak,et al.  Elementary Number Theory, Group Theory, and Ramanujan Graphs: Graph Theory , 2003 .

[38]  Elchanan Mossel,et al.  Mixing times of the biased card shuffling and the asymmetric exclusion process , 2002, math/0207199.

[39]  M. Newman.  Spread of epidemic disease on networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[40]  Robert Elsässer,et al.  Spectral methods for efficient load balancing strategies , 2002, Ausgezeichnete Informatikdissertationen.

[41]  Herbert W. Hethcote,et al.  The Mathematics of Infectious Diseases , 2000, SIAM Rev..

[42]  Richard M. Karp,et al.  Randomized rumor spreading , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[43]  O. Schramm,et al.  On the Cover Time of Planar Graphs , 2000, math/0002034.

[44]  C. Scheideler.  Probabilistic Methods for Coordination Problems , 2000 .

[45]  Eli Upfal,et al.  Balanced Allocations , 1999, SIAM J. Comput..

[46]  Ralf Diekmann,et al.  Efficient schemes for nearest neighbor load balancing , 1999, Parallel Comput..

[47]  Marios Mavronicolas,et al.  Sequentially consistent versus linearizable counting networks , 1999, PODC '99.

[48]  Yuval Peres,et al.  Resistance Bounds for First-Passage Percolation and Maximum Flow , 1999, J. Comb. Theory, Ser. A.

[49]  Yuval Rabani,et al.  Local divergence of Markov chains and the analysis of iterative load-balancing schemes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[50]  Uriel Feige.  A Spectrum of Time-Space Trade-Offs for Undirected s-t Connectivity , 1997, J. Comput. Syst. Sci..

[51]  Yoshiharu Kohayakawa,et al.  On Richardsons model on the hypercube , 1997 .

[52]  Peter Winkler,et al.  Multiple cover time , 1996, Random Struct. Algorithms.

[53]  S. Muthukrishnan,et al.  Dynamic Load Balancing by Random Matchings , 1996, J. Comput. Syst. Sci..

[54]  Dhar,et al.  Eulerian Walkers as a Model of Self-Organized Criticality. , 1996, Physical review letters.

[55]  N. Alon.  Tools from higher algebra , 1996 .

[56]  P. Diaconis,et al.  The cutoff phenomenon in finite Markov chains. , 1996, Proceedings of the National Academy of Sciences of the United States of America.

[57]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[58]  Uriel Feige,et al.  A Tight Lower Bound on the Cover Time for Random Walks on Graphs , 1995, Random Struct. Algorithms.

[59]  Jang-Ping Sheu,et al.  An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs , 1995, IEEE Trans. Parallel Distributed Syst..

[60]  C. G. Plaxton,et al.  Tight analyses of two local load balancing algorithms , 1995, STOC '95.

[61]  Uriel Feige,et al.  A Tight Upper Bound on the Cover Time for Random Walks on Graphs , 1995, Random Struct. Algorithms.

[62]  Chandra GowriSankaran,et al.  Broadcasting on recursively decomposable Cayley graphs , 1994 .

[63]  Maurice Herlihy,et al.  Counting networks , 1994, JACM.

[64]  Uriel Feige.  Collecting Coupons on Trees, and the Analysis of Random Walks , 1993 .

[65]  Bruce M. Maggs,et al.  Approximate load balancing on dynamic and asynchronous networks , 1993, STOC.

[66]  Alistair Sinclair,et al.  Algorithms for Random Generation and Counting: A Markov Chain Approach , 1993, Progress in Theoretical Computer Science.

[67]  Alistair Sinclair,et al.  Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow , 1992, Combinatorics, Probability and Computing.

[68]  C. Greg Plaxton,et al.  Small-depth counting networks , 1992, STOC '92.

[69]  Harald Niederreiter,et al.  Random number generation and Quasi-Monte Carlo methods , 1992, CBMS-NSF regional conference series in applied mathematics.

[70]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[71]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[72]  Arndt Bode.  Load balancing in distributed memory multiprocessors , 1991, [1991] Proceedings, Advanced Computer Technology, Reliable Systems and Applications.

[73]  J. A. Fill.  Eigenvalue bounds on convergence to stationarity for nonreversible markov chains , 1991 .

[74]  W. O. Kermack,et al.  Contributions to the mathematical theory of epidemics—I , 1991, Bulletin of mathematical biology.

[75]  Eli Upfal,et al.  Randomized Broadcast in Networks , 1990, Random Struct. Algorithms.

[76]  David Zuckerman,et al.  A technique for lower bounding the cover time , 1990, STOC '90.

[77]  Russell Impagliazzo,et al.  How to recycle random bits , 1989, 30th Annual Symposium on Foundations of Computer Science.

[78]  Michael E. Saks,et al.  The periodic balanced sorting network , 1989, JACM.

[79]  Sheldon B. Akers,et al.  A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.

[80]  Prabhakar Raghavan,et al.  The electrical resistance of a graph captures its commute and cover times , 1989, STOC '89.

[81]  Eli Upfal,et al.  Trading space for time in undirected s-t connectivity , 1989, STOC '89.

[82]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[83]  David J. Aldous,et al.  Lower bounds for covering times for reversible Markov chains and random walks on graphs , 1989 .

[84]  A. Lubotzky,et al.  Ramanujan graphs , 2017, Comb..

[85]  Andrei Z. Broder,et al.  Bounds on the cover time , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[86]  Doug Terry,et al.  Epidemic algorithms for replicated database maintenance , 1988, OPSR.

[87]  P. Diaconis.  Group representations in probability and statistics , 1988 .

[88]  B. Pittel.  On spreading a rumor , 1987 .

[89]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[90]  Marc Snir,et al.  A Unified Theory of Interconnection Network Structure , 1986, Theor. Comput. Sci..

[91]  A. Odlyzko,et al.  Random Shuffles and Group Representations , 1985 .

[92]  Alan M. Frieze,et al.  The shortest-path problem for graphs with random arc-lengths , 1985, Discret. Appl. Math..

[93]  Alex Kane,et al.  Coins , 1984 .

[94]  Dieter Jungnickel,et al.  Einführung in die Kombinatorik , 1983 .

[95]  E. Szemerédi,et al.  O(n LOG n) SORTING NETWORK. , 1983 .

[96]  D. Aldous.  On the time taken by random walks on finite groups to visit every state , 1983 .

[97]  G. Grimmett,et al.  Probability and random processes , 2002 .

[98]  G. A. Margulis,et al.  Explicit constructions of graphs without short cycles and low density codes , 1982, Comb..

[99]  H. Poincaré,et al.  Percolation ? , 1982 .

[100]  P. Diaconis,et al.  Generating a random permutation with random transpositions , 1981 .

[101]  Sheldon M. Ross,et al.  Introduction to probability models , 1975 .

[102]  Donald E. Knuth,et al.  Sorting and Searching , 1973 .

[103]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[104]  Parag A. Pathak,et al.  Massachusetts Institute of Technology , 1964, Nature.

[105]  F. Harary.  THE MAXIMUM CONNECTIVITY OF A GRAPH. , 1962, Proceedings of the National Academy of Sciences of the United States of America.

[106]  Paul Erdös,et al.  On random graphs, I , 1959 .

[107]  C. McDiarmid.  Concentration , 1862, The Dental register.

[108]  Niels Henrik David Bohr,et al.  Proceedings of the Cambridge Philosophical Society , 1843 .

[109]  L. Asz.  Random Walks on Graphs: a Survey , 2022 .