Stably computable predicates are semilinear
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Computation in networks of passively mobile finite-state sensors
Distributed Computing - Special issue: PODC 04
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Recent Advances in Population Protocols
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
Brief announcement: decidable graph languages by mediated population protocols
DISC'09 Proceedings of the 23rd international conference on Distributed computing
When birds die: making population protocols fault-tolerant
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Theoretical Computer Science
Passively mobile communicating machines that use restricted space
FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
Passively mobile communicating machines that use restricted space
Theoretical Computer Science
The computational power of simple protocols for self-awareness on graphs
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Survey: Computational models for networks of tiny artifacts: A survey
Computer Science Review
The computational power of simple protocols for self-awareness on graphs
Theoretical Computer Science
Hi-index | 0.00 |
This work focuses on the computational power of the Mediated Population Protocol model on complete communication graphs and initially identical edges (SMPP). In particular, we investigate the class MPS of all predicates that are stably computable by the SMPP model. It is already known that MPS is in the symmetric subclass of NSPACE(n2). Here we prove that this inclusion holds with equality, thus, providing the following exact characterization for MPS: A predicate is in MPS iff it is symmetric and is in NSPACE(n2).