Population protocols for exact plurality consensus : how a small chance of failure helps to eliminate insignificant opinions

Bankhamer, GregorGregorBankhamerBerenbrink, PetraPetraBerenbrinkBiermeier, FelixFelixBiermeierElsässer, RobertRobertElsässerHosseinpour, HamedHamedHosseinpourKaaser, DominikDominikKaaserKling, PeterPeterKling2022-12-152022-12-152022-07Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (): 224-234 (2022-07-20)http://hdl.handle.net/11420/14368enpopulation protocolsplurality consensusrandomized algorithmsMathematikPopulation protocols for exact plurality consensus : how a small chance of failure helps to eliminate insignificant opinionsConference Paper10.1145/3519270.3538447Conference Paper