Finding the extrema of a distributed multiset

Journal of Parallel and Distributed Computing

Volumn 37, Issue 2, 1996, Pages 123-133

  Alimonti, Paola ^a   Flocchini, Paola ^b   Santoro, Nicola ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030587337     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1996.0113     Document Type: Article

References (19)

1. 1. H. Attiya, M. Snir, and M. K. Warmuth, Computing on an anonymous ring. Proc. of 4th ACM Symposium on Principles of Distributed Computing, 1985, pp. 196-203.
2. 2. H. Attiya, M. Snir, and M. K. Warmuth, Computing on an anonymous ring. J. Assoc. Comput. Mach. 35, 4 (1988), 845-875.
3. 3. A. Bar-Noi, J. Naor, and M. Naor, One bit algorithms. Distrib. Comput. 4, 1 (1990), 3-8.
4. 4. H. L. Bodlaender, New lower bound techniques for distributed leader finding and other problems on ring processors. Theoret. Comput. Sci. 81 (1991), 237-256.
5. 5. H. L. Bodlaender and G. Tel, Bit-optimal election in synchronous rings. Inform. Process. Lett. 36, 1 (1990), 53-56.
6. 6. J. Burns, A formal model for message passing systems. Technical Report UTR-91, Indian Univ., 1981.
7. 7. D. Dolev, M. Klawe, and M. Rodeh, An O(n log n) unidirectional algorithm for extrema-finding in a circle. J. Algorithms 3 (1986), 245-260.
8. 8. G. N. Frederickson and N. A. Lynch, Electing a leader in a synchronous ring. J. Assoc. Comput. Mach. 34, 1 (1987), 95-115.
9. 9. E. Gafni, Improvements in the time complexity of two message-optimal election algorighms. Proc. of 4th ACM Symposium on Principles of distributed Computing, 1985, pp. 175-185.
10. 10. J. van Leeuwen, N. Santoro, J. Urrutia, and S. Zaks, Guessing games and distributed computations in synchronous networks. Proc. of 14th International Colloquium on Automata, Languages and Programming, 1987, Vol. 267, pp. 347-356.
11. 11. A. Marchetti-Spaccamela, New protocols for the election of a leader in a ring. Theoret. Comput. Sci. 54, 1 (1987), 53-64.
12. 12. U. M. O'Reilly and N. Santoro, The expressiveness of silence: Tight bounds for synchronous communication of information using bits and silence. Proc. of 18th International Workshop on Graph-Theoretic Concepts in Computer Science, 1992, pp. 321-332.
13. 13. M. Overmars and N. Santoro, Improved bounds for electing a leader in a synchronous ring. Algorithmica, to appear.
14. 14. J. Pachl, D. Rotem, and E. Korach, Lower bounds for distributed maximum finding algorithms. J. Assoc. Comput. Mach. 31 (1984), 380-401.
15. 15. G. L. Peterson, An O(n log n) unidirectional algorithm for the circular extrema problem. ACM Trans. Programming Languages Systems 4 (1982), 758-762.
16. 16. N. Santoro and D. Rotem, On the complexity of distributed elections in synchronous graphs. Proc. of 11th International Workshop on Graph-Theoretic Concepts in Computer Science, 1985, pp. 337-346.
17. 17. B. Schmeltz, Optimal tradeoffs between time and bit complexity in synchronous rings. Proc. of 10th Symposium on Theoretical Aspects of Computer Science, 1990, pp. 275-284.
18. 18. P. Spirakis and B. Tampakas, Efficient distributed algorithms by using the Archimedean time assumption. Proc. of 5th Symposium on Theoretical Aspects of Computer Science, 1988, pp. 248-263.
19. 19. P. Vitanyi, Distributed elections in an Archimedean ring of entities. Proc. of 16th ACM Symposium on Theory of Computing, 1984, pp. 542-547.