Tail bounds for occupancy and the satisfiability threshold conjecture
Random Structures & Algorithms
ACM Transactions on Computer Systems (TOCS)
Phase Clocks for Transient Fault Repair
IEEE Transactions on Parallel and Distributed Systems
Maintaining Digital Clocks In Step
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
Computation in networks of passively mobile finite-state sensors
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Self-stabilizing clock synchronization in the presence of Byzantine faults
Journal of the ACM (JACM)
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
Computation in networks of passively mobile finite-state sensors
Distributed Computing - Special issue: PODC 04
Self-stabilizing pulse synchronization inspired by biological pacemaker networks
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Stabilizing consensus in mobile networks
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor 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
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
Self-stabilizing counting in mobile sensor networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Computation with finite stochastic chemical reaction networks
Natural Computing: an international journal
On the computational capabilities of several models
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Secretive birds: privacy in population protocols
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Loosely-Stabilizing leader election in population protocol model
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Loosely-stabilizing leader election in a population protocol model
Theoretical Computer Science
A simple population protocol for fast robust approximate majority
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Self-stabilizing counting in mobile sensor networks with a base station
DISC'07 Proceedings of the 21st international conference on Distributed Computing
| Hi-index | 0.00 |
Fast algorithms are presented for performing computations in a probabilistic population model. This is a variant of the standard population protocol model—in which finite-state agents interact in pairs under the control of an adversary scheduler—where all pairs are equally likely to be chosen for each interaction. It is shown that when a unique leader agent is provided in the initial population, the population can simulate a virtual register machine in which standard arithmetic operations like comparison, addition, subtraction, and multiplication and division by constants can be simulated in O(n log4n) interactions with high probability. Applications include a reduction of the cost of computing a semilinear predicate to O(n log4n) interactions from the previously best-known bound of O(n2 logn) interactions and simulation of a LOGSPACE Turing machine using the same O(n log4n) interactions per step. These bounds on interactions translate into O(log4n) time per step in a natural parallel model in which each agent participates in an expected Θ(1) interactions per time unit. The central method is the extensive use of epidemics to propagate information from and to the leader, combined with an epidemic-based phase clock used to detect when these epidemics are likely to be complete.