Nondeterministic space is closed under complementation
SIAM Journal on Computing
Selected papers of the Second Workshop on Concurrency and compositionality
Journal of the ACM (JACM)
On Communicating Finite-State Machines
Journal of the ACM (JACM)
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Decidability and Complexity of Petri Net Problems - An Introduction
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Lightweight sensing and communication protocols for target enumeration and aggregation
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Catalytic P systems, semilinear sets, and vector addition systems
Theoretical Computer Science
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Computation: finite and infinite machines
Computation: finite and infinite machines
Computational Linguistics
Stably computable properties of network graphs
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
A new class of nature-inspired algorithms for self-adaptive peer-to-peer computing
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Self-stabilizing population protocols
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Self-similar Functions and Population Protocols: A Characterization and a Comparison
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
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
Proceedings of the 28th ACM symposium on Principles of distributed computing
Not All Fair Probabilistic Schedulers Are Equivalent
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
On the self-stabilization of mobile robots in graphs
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Secretive birds: privacy in population protocols
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Distributed computation in dynamic networks
Proceedings of the forty-second ACM symposium on Theory of computing
On utilizing speed in networks of mobile agents
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Stably decidable graph languages by mediated 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
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Improving space complexity of self-stabilizing counting on mobile sensor networks
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Self-stabilizing tiny interaction protocols
Proceedings of the Third International Workshop on Reliability, Availability, and Security
Theoretical Computer Science
Strand algebras for DNA computing
Natural Computing: an international journal
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
Fast computation by population protocols with a leader
DISC'06 Proceedings of the 20th international conference on Distributed Computing
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Space complexity of self-stabilizing leader election in passively-mobile anonymous agents
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Characterizing topological assumptions of distributed algorithms in dynamic networks
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Loosely-Stabilizing leader election in population protocol model
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Anonymous agreement: the janus algorithm
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Self-stabilizing mutual exclusion and group mutual exclusion for population protocols with covering
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Loosely-stabilizing leader election in a population protocol model
Theoretical Computer Science
Survey: Computational models for networks of tiny artifacts: A survey
Computer Science Review
A simple population protocol for fast robust approximate majority
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Terminating population protocols via some minimal global knowledge assumptions
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Collecting information by power-aware mobile agents
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Position discovery for a system of bouncing robots
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Stone age distributed computing
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Localization for a system of colliding robots
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Temporal network optimization subject to connectivity constraints
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Tight complexity analysis of population protocols with cover times - The ZebraNet example
Theoretical Computer Science
The computational power of simple protocols for self-awareness on graphs
Theoretical Computer Science
Causality, influence, and computation in possibly disconnected synchronous dynamic networks
Journal of Parallel and Distributed Computing
Information and Computation
Effective storage capacity of labeled graphs
Information and Computation
Hi-index | 0.01 |
The computational power of networks of small resource-limited mobile agents is explored. Two new models of computation based on pairwise interactions of finite-state agents in populations of finite but unbounded size are defined. With a fairness condition on interactions, the concept of stable computation of a function or predicate is defined. Protocols are given that stably compute any predicate in the class definable by formulas of Presburger arithmetic, which includes Boolean combinations of threshold-k, majority, and equivalence modulo m. All stably computable predicates are shown to be in NL. Assuming uniform random sampling of interacting pairs yields the model of conjugating automata. Any counter machine with O (1) counters of capacity O (n) can be simulated with high probability by a conjugating automaton in a population of size n. All predicates computable with high probability in this model are shown to be in P; they can also be computed by a randomized logspace machine in exponential time. Several open problems and promising future directions are discussed.