The complexity of sorting on distributed systems
Information and Control
Uniform self-stabilizing ring orientation
Information and Computation
Swarm intelligence: from natural to artificial systems
Swarm intelligence: from natural to artificial systems
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Sorting and election in anonymous asynchronous rings
Journal of Parallel and Distributed Computing
Design patterns from biology for distributed computing
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Using Ant's Brood Sorting to Increase Fault Tolerance in Linda's Tuple Distribution Mechanism
CIA '07 Proceedings of the 11th international workshop on Cooperative Information Agents XI
GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Hi-index | 0.00 |
We examine sorting on the assumption we do not know in advance which way to sort. We use simple local comparison and swap operators and demonstrate that their repeated application ends up in sorted sequences. These are the basic elements of Emerge-Sort, an approach to self-organizing sorting, which we experimentally validate and observe a run-time behavior of O(n2).