Determining Majority in Networks with Local Interactions and Very Small Local Memory

DOI10.1007/978-3-662-43948-7_72zbMath1404.68020arXiv1404.7671OpenAlexW2109043215MaRDI QIDQ5167799

George B. Mertzios, Christoforos L. Raptopoulos, Sotiris E. Nikoletseas, Paul G. Spirakis

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network protocols (68M12)

Related Items (14)

On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols ⋮ Information Spreading by Mobile Particles on a Line ⋮ A Glimpse at Paul G. Spirakis ⋮ Simple dynamics for plurality consensus ⋮ Synthesizing and Tuning Chemical Reaction Networks with Specified Behaviours ⋮ The Power of Global Knowledge on Self-stabilizing Population Protocols ⋮ Chemical reaction network designs for asynchronous logic circuits ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Near Time-optimal Population Protocol for Self-stabilizing Leader Election on Rings with a Poly-logarithmic Number of States ⋮ Uniform bipartition in the population protocol model with arbitrary graphs ⋮ Determining majority in networks with local interactions and very small local memory ⋮ Time-space trade-offs in population protocols for the majority problem ⋮ A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States

This page was built for publication: Determining Majority in Networks with Local Interactions and Very Small Local Memory