Space measures for storage modification machines
Information Processing Letters
Conditions on input vectors for consensus solvability in asynchronous distributed systems
Journal of the ACM (JACM)
Computation in networks of passively mobile finite-state sensors
Distributed Computing - Special issue: PODC 04
When birds die: making population protocols fault-tolerant
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Not All Fair Probabilistic Schedulers Are Equivalent
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Algorithmic verification of population protocols
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Storage capacity of labeled graphs
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed 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
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
Information and Computation
Effective storage capacity of labeled graphs
Information and Computation
| Hi-index | 0.00 |
We introduce a new theoretical model of ad hoc mobile computing in which agents have restricted memory, highly unpredictable movement and no initial knowledge of the system. Each agent's memory can store O (1) bits, plus a unique identifier, and O (1) other agents' identifiers. Inputs are distributed across n agents, and all agents must converge to the correct output value. We give a universal construction that proves the model is surprisingly strong: It can solve any decision problem in NSPACE (n logn ). Moreover, the construction is robust with respect to Byzantine failures of a constant number of agents.