Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases
IEEE Transactions on Parallel and Distributed Systems
Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct
IEEE Transactions on Parallel and Distributed Systems
Discrete Mathematics
Can we elect if we cannot compare?
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Mobile Agent Rendezvous in a Ring
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Comparing the expressive power of the synchronous and asynchronous $pi$-calculi
Mathematical Structures in Computer Science
Rendezvous and Election of Mobile Agents: Impact of Sense of Direction
Theory of Computing Systems
Map construction of unknown graphs by multiple agents
Theoretical Computer Science
An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Mobile agent algorithms versus message passing algorithms
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Election in the qualitative world
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Rendezvous of mobile agents without agreement on local orientation
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
| Hi-index | 5.23 |
In ''Can we elect if we cannot compare'' (SPAA'03), Barriere, Flocchini, Fraigniaud and Santoro consider a qualitative model of distributed computing, where the labels of the entities are distinct but mutually incomparable. They study the leader election problem in a distributed mobile environment and they wonder whether there exists an algorithm such that for each distributed mobile environment, it either states that the problem cannot be solved in this environment, or it successfully elects a leader. In this paper, we give a positive answer to this question. We also give a characterization of the distributed mobile environments where election and rendezvous can be solved.