Local and Global Properties in Networks of Processors, Proc. 12th ACM Symposium on Theory of Computation (STOC'81, pp.82-93, 1981. ,
Computing on an anonymous ring, Journal of the ACM, vol.35, issue.4, pp.845-876, 1988. ,
DOI : 10.1145/48014.48247
Distributed Computing: Fundamentals, Simulations and Advanced Topics, p.414, 2004. ,
DOI : 10.1002/0471478210
Some lower bound results for decentralized extrema-finding in rings of processors, Journal of Computer and System Sciences, vol.42, issue.1, pp.97-118, 1991. ,
DOI : 10.1016/0022-0000(91)90041-3
An improved algorithm for decentralized extrema-finding in circular configurations of processes, Communications of the ACM, vol.22, issue.5, pp.281-283, 1979. ,
DOI : 10.1145/359104.359108
An O(n log n) unidirectional distributed algorithm for extrema finding in a circle, Journal of Algorithms, vol.3, issue.3, pp.245-260, 1982. ,
DOI : 10.1016/0196-6774(82)90023-2
A simple, efficient algorithm for maximum finding on rings, Information Processing Letters, vol.58, issue.6, pp.319-324, 1996. ,
DOI : 10.1016/0020-0190(96)00069-5
Decentralized extrema-finding in circular configurations of processors, Communications of the ACM, vol.23, issue.11, pp.627-655, 1980. ,
DOI : 10.1145/359024.359029
Distributed Systems: Towards a Formal Approach, IFIP World Congress, pp.155-160, 1977. ,
An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem, ACM Transactions on Programming Languages and Systems, vol.4, issue.4, pp.758-762, 1982. ,
DOI : 10.1145/69622.357194
Algorithms for Mutual Exclusion, 1986. ,
URL : https://hal.archives-ouvertes.fr/inria-00075198
Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems, Synthesis Lectures on Distributed Computing Theory, vol.1, issue.1, 2010. ,
DOI : 10.2200/S00236ED1V01Y201004DCT002
URL : https://hal.archives-ouvertes.fr/inria-00543036
Design and Analysis of Distributed Algorithms, 2007. ,
DOI : 10.1002/0470072644