Electing a leader in a synchronous ring
Journal of the ACM (JACM)
Detecting global termination conditions in the face of uncertainty
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Computing on an anonymous network
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases
IEEE Transactions on Parallel and Distributed Systems
Computing on Anonymous Networks: Part II-Decision and Membership Problems
IEEE Transactions on Parallel and Distributed Systems
Symmetry and similarity in distributed systems
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
An improved algorithm for decentralized extrema-finding in circular configurations of processes
Communications of the ACM
On the Dynamic Initialization of Parallel Computers
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Electing a Leader when Processor Identity Numbers are not Distinct (Extended Abstract)
Proceedings of the 3rd International Workshop on Distributed Algorithms
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Elections in the presence of faults
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Fault Tolerant Leader Election with Termination Detection, in General Undirected Networks
Fault Tolerant Leader Election with Termination Detection, in General Undirected Networks
Sorting and election in anonymous asynchronous rings
Journal of Parallel and Distributed Computing
Simulation of a Novel Leader Election Protocol with the Use of Petri Nets
DS-RT '05 Proceedings of the 9th IEEE International Symposium on Distributed Simulation and Real-Time Applications
Local Computations in Graphs: The Case of Cellular Edge Local Computations
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
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
Election and rendezvous with incomparable labels
Theoretical Computer Science
On bootstrapping topology knowledge in anonymous networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Computing on a partially eponymous ring
Theoretical Computer Science
On bootstrapping topology knowledge in anonymous networks
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
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
Robot networks with homonyms: the case of patterns formation
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Computing on a partially eponymous ring
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
A leader election protocol for timed asynchronous distributed systems
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Graph labelings derived from models in distributed computing
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Local computations on closed unlabelled edges: the election problem and the naming problem
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
A knowledge-based analysis of global function computation
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Exact Quantum Algorithms for the Leader Election Problem
ACM Transactions on Computation Theory (TOCT)
Anonymous agreement: the janus algorithm
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Decidability classes for mobile agents computing
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Distributed maximal matching: greedy is optimal
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Weak models of distributed computing, with connections to modal logic
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
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
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Local Computations in Graphs: The Case of Cellular Edge Local Computations
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
Enumeration and Leader Election in Partially Anonymous and Multi-hop Broadcast Networks
Fundamenta Informaticae
Lower bounds for local approximation
Journal of the ACM (JACM)
| Hi-index | 0.00 |
In the networks considered in this paper, processors do not have distinct identity numbers. On such a network, we discuss the leader election problem and the problem of counting the number of processors having the same identity number. As the communication mode, we consider port-to-port, broadcast-to-port, port-to-mailbox, and broadcast-to-mailbox. For each of the above communication modes, we present: 1) an algorithm for counting the number of processors with the same identity number, 2) an algorithm for solving the leader election problem, and 3) a graph theoretical characterizatoin of the solvable class for the leader election problem.