Mediated population protocols
From MaRDI portal
Publication:533894
DOI10.1016/J.TCS.2011.02.003zbMATH Open1218.68082OpenAlexW2105431882WikidataQ57608051 ScholiaQ57608051MaRDI QIDQ533894FDOQ533894
Authors: Othon Michail, Ioannis Chatzigiannakis, P. G. Spirakis 
Publication date: 10 May 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.02.003
Recommendations
diffuse computationfinite-state agentintermittent communicationpassive mobilitypopulation protocolstable computation
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Mathematical problems of computer architecture (68M07)
Cites Work
- Computation in networks of passively mobile finite-state sensors
- Semigroups, Presburger formulas, and languages
- The computational power of population protocols
- Fast computation by population protocols with a leader
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nondeterministic Space is Closed under Complementation
- Stably computable predicates are semilinear
- A simple population protocol for fast robust approximate majority
- Title not available (Why is that?)
- On the convergence of population protocols when population goes to infinity
- Recent Advances in Population Protocols
- The Dynamics of Probabilistic Population Protocols
- All symmetric predicates in NSPACE\((n^{2})\) are stably computable by the mediated population protocol model
- Mediated Population Protocols
- Computational models for networks of tiny artifacts: a survey
- Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
- Computation in networks of passively mobile finite-state sensors
- Passively mobile communicating machines that use restricted space
- Playing with population protocols
- Self-stabilizing counting in mobile sensor networks
Cited In (42)
- Title not available (Why is that?)
- Tight complexity analysis of population protocols with cover times -- the ZebraNet example
- The computational power of simple protocols for self-awareness on graphs
- Large flocks of small birds: on the minimal size of population protocols
- Passively mobile communicating machines that use restricted space
- Title not available (Why is that?)
- Fault-tolerant simulation of population protocols
- Stably computable predicates are semilinear
- Protocols with constant local storage and unreliable communication
- A Survey on Analog Models of Computation
- Traveling salesman problems in temporal graphs
- Distributed computation and reconfiguration in actively dynamic networks
- Running time analysis of broadcast consensus protocols
- All symmetric predicates in NSPACE\((n^{2})\) are stably computable by the mediated population protocol model
- Homonym population protocols
- Mediated population protocols: leader election and applications
- The complexity of optimal design of temporally connected graphs
- Causality, influence, and computation in possibly disconnected synchronous dynamic networks
- Simple and fast approximate counting and leader election in populations
- Population protocols with unreliable communication
- Space-efficient self-stabilizing counting population protocols on mobile sensor networks
- Fault tolerant network constructors
- Clocked population protocols
- Terminating distributed construction of shapes and patterns in a fair solution of automata
- An introduction to temporal graphs: an algorithmic perspective
- An introduction to temporal graphs: an algorithmic perspective
- Network Constructors: A Model for Programmable Matter
- Recent Advances in Population Protocols
- Temporal network optimization subject to connectivity constraints
- On space complexity of self-stabilizing leader election in mediated population protocol
- The Dynamics of Probabilistic Population Protocols
- Mediated Population Protocols
- Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication
- Population protocols on graphs: a hierarchy
- The complexity of verifying population protocols
- How many cooks spoil the soup?
- Fault tolerant network constructors
- A glimpse at Paul G. Spirakis
- Blockchain in dynamic networks
- How Many Cooks Spoil the Soup?
- Connectivity preserving network transformers
- Connectivity preserving network transformers
This page was built for publication: Mediated population protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q533894)
