Nondeterministic space is closed under complementation
SIAM Journal on Computing
Selected papers of the Second Workshop on Concurrency and compositionality
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)
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
Stably computable predicates are semilinear
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Self-stabilizing counting in mobile sensor networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Labelled (Hyper)Graphs, Negotiations and the Naming Problem
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
The Dynamics of Probabilistic Population Protocols
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
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
Making Population Protocols Self-stabilizing
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Not All Fair Probabilistic Schedulers Are Equivalent
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
On the computational capabilities of several models
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
On the self-stabilization of mobile robots in graphs
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Brief announcement: decidable graph languages by mediated population protocols
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Distributed estimation of global parameters in delay-tolerant networks
Computer Communications
A self-organization mechanism based on cross-entropy method for P2P-like applications
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Algorithmic verification of population protocols
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Stably decidable graph languages by mediated population protocols
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Dynamic networks: models and algorithms
ACM SIGACT News
Theoretical Computer Science
On the number of binary-minded individuals required to compute 12
Theoretical Computer Science
What dependability for networks of mobile sensor
HotDep'05 Proceedings of the First conference on Hot topics in system dependability
Computing time complexity of population protocols with cover times: the zebranet example
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Self-stabilizing leader election in networks of finite-state anonymous agents
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
When birds die: making population protocols fault-tolerant
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Stably computable properties of network graphs
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Fast computation by population protocols with a leader
DISC'06 Proceedings of the 20th international conference on Distributed Computing
What can be implemented anonymously?
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Self-stabilizing synchronization in mobile sensor networks with covering
DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
Self-stabilizing population protocols
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
On the power of anonymous one-way communication
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
MADNES'05 Proceedings of the First international conference on Secure Mobile Ad-hoc Networks and Sensors
Population protocols on real social networks
Proceedings of the Fifth Workshop on Social Network Systems
Computing with pavlovian populations
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Survey: Computational models for networks of tiny artifacts: A survey
Computer Science Review
Computing with large populations using interactions
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Population protocols on real social networks
Proceedings of the 9th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Self-stabilizing counting in mobile sensor networks with a base station
DISC'07 Proceedings of the 21st international conference on Distributed Computing
The computational power of simple protocols for self-awareness on graphs
Theoretical Computer Science
Hi-index | 0.00 |
We explore the computational power of networks of small resource-limited mobile agents. We define two new models of computation based on pairwise interactions of finite-state agents in populations of finite but unbounded size. With a fairness condition on interactions, we define the concept of stable computation of a function or predicate, and give protocols that stably compute functions in a class including Boolean combinations of threshold-k, parity, majority, and simple arithmetic. We prove that all stably computable predicates are in NL. With uniform random sampling of pairs to interact, we define the model of conjugating automata and show that any counter machine with O(1) counters of capacity O(n) can be simulated with high probability by a protocol in a population of size n. We prove that all predicates computable with high probability in this model are in P ∩ RL. Several open problems and promising future directions are discussed.