Determining majority in networks with local interactions and very small local memory
From MaRDI portal
Publication:518677
DOI10.1007/s00446-016-0277-8zbMath1404.68021OpenAlexW2472645009MaRDI QIDQ518677
George B. Mertzios, Christoforos L. Raptopoulos, Sotiris E. Nikoletseas, Paul G. Spirakis
Publication date: 29 March 2017
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: http://dro.dur.ac.uk/19002/1/19002.pdf
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
On convergence and threshold properties of discrete Lotka-Volterra population protocols ⋮ Phase Transition of a Non-linear Opinion Dynamics with Noisy Interactions ⋮ Approximate majority analyses using tri-molecular chemical reaction networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple population protocol for fast robust approximate majority
- On computing majority by comparisons
- Ergodic theorems for weakly interacting infinite systems and the voter model
- Computation in networks of passively mobile finite-state sensors
- Fast computation by population protocols with a leader
- Fast and Exact Majority in Population Protocols
- Convergence Speed of Binary Interval Consensus
- Extremal Combinatorics
- Randomized Algorithms for Determining the Majority on Graphs
- The Byzantine Generals Problem
- Markov Chains
- Reaching a Consensus
- Determining Majority in Networks with Local Interactions and Very Small Local Memory
- Optimization of Reduced Dependencies for Synchronous Sequential Machines
This page was built for publication: Determining majority in networks with local interactions and very small local memory
