Ignore or Comply?-Reference-Cited by-同舟云学术

Ignore or Comply?

Published:2017-07-25 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the ACM Symposium on Principles of Distributed Computing
language:
Short-container-title:

Author:

Berenbrink Petra¹,Clementi Andrea²,Elsässer Robert³,Kling Peter¹,Mallmann-Trenn Frederik⁴,Natale Emanuele⁵

Affiliation:

1. University of Hamburg, Hamburg, Germany

2. Università di Roma Tor Vergata, Rome, Italy

3. University of Salzburg, Salzburg, Austria

4. École Normale Supérieure, Paris, France

5. Max Planck Institute for Informatics, Saarbrücken, Germany

Funder

Austrian Science Fund

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3087801.3087817

Reference29 articles.

1. D. Aldous and J. Fill. Reversible markov chains and random walks on graphs 2002. Unpublished. http://www.stat.berkeley.edu/aldous/RWG/book.html. D. Aldous and J. Fill. Reversible markov chains and random walks on graphs 2002. Unpublished. http://www.stat.berkeley.edu/aldous/RWG/book.html.

2. Simple dynamics for plurality consensus

3. Plurality Consensus in the Gossip Model

4. Stabilizing Consensus with Many Opinions

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

1. Quasi‐majority functional voting on expander graphs;Random Structures & Algorithms;2024-05-21

2. Asynchronous opinion dynamics in social networks;Distributed Computing;2024-04-26

3. Distributed Averaging in Opinion Dynamics;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16

4. Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16

5. On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting?;ACM Transactions on Algorithms;2023-04-21