AnO(log3/2n) Parallel Time Population Protocol for Majority withO(logn) States

DOI10.1145/3382734.3405747OpenAlexW3046268161MaRDI QIDQ5855232FDOQ5855232

Matan Kraus, Tsvi Kopelowitz, Ely Porat, Stav Ben-Nun

Publication date: 15 March 2021

Published in: Proceedings of the 39th Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.12633

zbMATH Keywords

majoritypopulation protocols

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Cited In (5)

• A survey of size counting in population protocols
• Distributed computation with continual population growth
• Uniform bipartition in the population protocol model with arbitrary graphs
• Title not available (Why is that?)
• Fast Convergence of k-Opinion Undecided State Dynamics in the Population Protocol Model

This page was built for publication: AnO(log^3/2n) Parallel Time Population Protocol for Majority withO(logn) States

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5855232)