Solvability of the asynchronous ranking problem
Information Processing Letters
Distributed disassembly of mosaics
Information Processing Letters
Introduction to distributed algorithms
Introduction to distributed algorithms
An introduction to distributed algorithms
An introduction to distributed algorithms
Information Processing Letters
A Characterization of Families of Graphs in Which Election Is Possible
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
The Power and the Limitations of Local Computations on Graphs
WG '92 Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science
Locally Computable Enumerations
FCT '97 Proceedings of the 11th International Symposium on Fundamentals of Computation Theory
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Semi-local Model of Computations on Graphs to Break the Local Symmetry
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We consider finite connected undirected graphs as a model for anonymous computer networks. In this framework we show a general purpose distributed election protocol, which uses forward links over the standard communication channels between processors. The forward links are represented in the form of structured labels, so the algorithm is in fact a graph relabelling system. However, its transformations are not local in the classical sense. For this particular algorithm we define a new notion of semi-locality. We claim that semi-local computations are as powerful as global ones, while still conforming to the intuitive meaning of the locality term.