Pages that link to "Item:Q352239"

The following pages link to A simple population protocol for fast robust approximate majority (Q352239):

Displaying 43 items.

• Modular verification of chemical reaction network encodings via serializability analysis (Q288812) (← links)
• Loosely-stabilizing leader election in a population protocol model (Q442276) (← links)
• Determining majority in networks with local interactions and very small local memory (Q518677) (← links)
• Mediated population protocols (Q533894) (← links)
• Passively mobile communicating machines that use restricted space (Q650876) (← links)
• Population protocols with faulty interactions: the impact of a leader (Q1628589) (← links)
• Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication (Q1689748) (← links)
• Speed faults in computation by chemical reaction networks (Q1689751) (← links)
• Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits (Q2002052) (← links)
• Verifying polymer reaction networks using bisimulation (Q2003997) (← links)
• Time-space trade-offs in population protocols for the majority problem (Q2025852) (← links)
• Distributed computation with continual population growth (Q2104041) (← links)
• ppsim: a software package for efficiently simulating and visualizing population protocols (Q2142123) (← links)
• On convergence and threshold properties of discrete Lotka-Volterra population protocols (Q2168846) (← links)
• Step-by-step community detection in volume-regular graphs (Q2210514) (← links)
• Fault-tolerant simulation of population protocols (Q2220403) (← links)
• Uniform bipartition in the population protocol model with arbitrary graphs (Q2235772) (← links)
• Data collection in population protocols with non-uniformly random scheduler (Q2285150) (← links)
• Robust biomolecular finite automata (Q2306018) (← links)
• Noisy rumor spreading and plurality consensus (Q2318110) (← links)
• Fast computation by population protocols with a leader (Q2377254) (← links)
• Simple dynamics for plurality consensus (Q2401681) (← links)
• Verifying chemical reaction network implementations: a bisimulation approach (Q2422008) (← links)
• Chemical Reaction Network Designs for Asynchronous Logic Circuits (Q2835704) (← links)
• Verifying Chemical Reaction Network Implementations: A Bisimulation Approach (Q2835707) (← links)
• TTLed Random Walks for Collaborative Monitoring in Mobile and Social Networks (Q2913793) (← links)
• Synthesizing and Tuning Chemical Reaction Networks with Specified Behaviours (Q2948406) (← links)
• Constant-Space Population Protocols for Uniform Bipartition (Q3300820) (← links)
• On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols (Q3448801) (← links)
• Polylogarithmic-Time Leader Election in Population Protocols (Q3449497) (← links)
• (Q4993318) (← links)
• (Q5005128) (← links)
• Data Collection in Population Protocols with Non-uniformly Random Scheduler (Q5056046) (← links)
• Phase Transition of a Non-linear Opinion Dynamics with Noisy Interactions (Q5100964) (← links)
• Find Your Place: Simple Distributed Algorithms for Community Detection (Q5115703) (← links)
• Modular Verification of DNA Strand Displacement Networks via Serializability Analysis (Q5168504) (← links)
• (Q5874482) (← links)
• Stable leader election in population protocols requires linear time (Q5915694) (← links)
• Computing with biological switches and clocks (Q6062026) (← links)
• (Q6079215) (← links)
• Chemical reaction network designs for asynchronous logic circuits (Q6084209) (← links)
• Phase transition of the \(k\)-majority dynamics in biased communication models (Q6099029) (← links)
• Approximate majority analyses using tri-molecular chemical reaction networks (Q6151168) (← links)