Stabilizing Consensus with Many Opinions
暂无分享,去创建一个
Luca Trevisan | Andrea E. F. Clementi | Luca Becchetti | Emanuele Natale | Francesco Pasquale | L. Trevisan | L. Becchetti | A. Clementi | Emanuele Natale | F. Pasquale
[1] J. Doob. Stochastic processes , 1953 .
[2] Leslie Lamport,et al. Reaching Agreement in the Presence of Faults , 1980, JACM.
[3] Michael O. Rabin,et al. Randomized byzantine generals , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[4] Doug Terry,et al. Epidemic algorithms for replicated database maintenance , 1988, OPSR.
[5] David Williams,et al. Probability with Martingales , 1991, Cambridge mathematical textbooks.
[6] Richard M. Karp,et al. Randomized rumor spreading , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[7] S. Pratt,et al. Information flow, opinion polling and collective intelligence in house-hunting social insects. , 2002, Philosophical transactions of the Royal Society of London. Series B, Biological sciences.
[8] Johannes Gehrke,et al. Gossip-based computation of aggregate information , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[9] Michael J. Fischer,et al. Computation in networks of passively mobile finite-state sensors , 2004, PODC '04.
[10] N. Linial,et al. Expander Graphs and their Applications , 2006 .
[11] David Eisenstat,et al. Stably computable predicates are semilinear , 2006, PODC '06.
[12] Michael J. Fischer,et al. Stabilizing Consensus in Mobile Networks , 2006, DCOSS.
[13] David Eisenstat,et al. A Simple Population Protocol for Fast Robust Approximate Majority , 2007, DISC.
[14] Elizabeth L. Wilmer,et al. Markov Chains and Mixing Times , 2008 .
[15] Yongxiang Ruan,et al. Binary consensus with soft information processing in cooperative networks , 2008, 2008 47th IEEE Conference on Decision and Control.
[16] Milan Vojnovic,et al. Using Three States for Binary Consensus on Complete Graphs , 2009, IEEE INFOCOM 2009.
[17] Dariusz R. Kowalski,et al. Distributed agreement with optimal communication complexity , 2010, SODA '10.
[18] Andrea E. F. Clementi,et al. Flooding Time of Edge-Markovian Evolving Graphs , 2010, SIAM J. Discret. Math..
[19] Andrea Montanari,et al. Tight Thresholds for Cuckoo Hashing via XORSAT , 2009, ICALP.
[20] Christian Scheideler,et al. Stabilizing consensus with the power of two choices , 2011, SPAA '11.
[21] Faster randomized consensus with an oblivious adversary , 2012, PODC '12.
[22] Luca Cardelli,et al. The Cell Cycle Switch Computes Approximate Majority , 2012, Scientific Reports.
[23] Elchanan Mossel,et al. Majority dynamics and aggregation of information in social networks , 2012, Autonomous Agents and Multi-Agent Systems.
[24] Mehmet E. Yildiz,et al. Binary Opinion Dynamics with Stubborn Agents , 2013, TEAC.
[25] Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication , 2013, PODC '14.
[26] Shlomi Dolev,et al. Direction election in flocking swarms , 2014, Ad Hoc Networks.
[27] Luca Trevisan,et al. Simple Dynamics for Majority Consensus , 2013, SPAA 2014.
[28] Colin Cooper,et al. The Power of Two Choices in Distributed Voting , 2014, ICALP.
[29] David Doty,et al. Timing in chemical reaction networks , 2013, SODA.
[30] Andrea E. F. Clementi,et al. Plurality Consensus in the Gossip Model , 2014, SODA.