Space efficient processor identity protocol
Information Processing Letters
The processor identity problem
Information Processing Letters
Comparison of initial conditions for distributed algorithms on anonymous networks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Computing anonymously with arbitrary knowledge
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
The Las-Vegas processor identity problem (how and when to be unique)
Journal of Algorithms
Wait-free consensus with infinite arrivals
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Computing in totally anonymous asynchronous shared memory systems
Information and Computation
Wakeup under Read/Write Atomicity
WDAG '90 Proceedings of the 4th International Workshop on Distributed Algorithms
An Effective Characterization of Computability in Anonymous Networks
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Computation in networks of passively mobile finite-state sensors
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Randomized naming using wait-free shared variables
Distributed Computing
Naming symmetric processes using shared variables
Distributed Computing
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
On the importance of having an identity or, is consensus really universal?
Distributed Computing - Special issue: DISC 04
Stably computable properties of network graphs
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
What can be implemented anonymously?
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Stably computable predicates are semilinear
Proceedings of the twenty-fifth 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 truth system: can a system of lying processes stabilize?
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security 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
Fast computation by population protocols with a leader
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Population protocols on real social networks
Proceedings of the 9th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
| Hi-index | 0.00 |
We consider a population of anonymous processes communicating via anonymous message-passing, where the recipient of each message is chosen by an adversary and the sender is not identified to the recipient. Even with unbounded message sizes and process states, such a system can compute only limited predicates on inputs held by the processes. In the finite-state case, we show how the exact strength of the model depends critically on design choices that are irrelevant in the unbounded-state case, such as whether messages are delivered immediately or after a delay, whether a sender can record that it has sent a message, and whether a recipient can queue incoming messages, refusing to accept new messages until it has had a chance to send out messages of its own. These results may have implications for the design of distributed systems where processor power is severely limited, as in sensor networks.