Computing on a partially eponymous ring

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4305 LNCS, Issue , 2006, Pages 380-394

  Mavronicolas, Marios ^a,b   Michael, Loizos ^c   Spirakis, Paul ^d,e  

^a UNIVERSITY OF CYPRUS   (Cyprus)

^b UNIVERSITY OF PADERBORN   (Germany)

^c HARVARD UNIVERSITY   (United States)

^d UNIVERSITY OF PATRAS   (Greece)

^e University of Patras and Computer Technology Institute   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; DISTRIBUTED COMPUTER SYSTEMS; TOPOLOGY;

DISTRIBUTED COMPUTATIONS; EPONYMOUS MODELS; GRACEFUL DEGRADATION; LEADER ELECTION; MESSAGE COMPLEXITY; NATURAL GENERALIZATION; UNIVERSAL ALGORITHM; UPPER BOUND;

O RINGS;

EID: 56449097032     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11945529_27     Document Type: Conference Paper

References (15)

1. D. Angluin, "Local and Global Properties in Networks of Processors," Proceedings of the 12th Annual ACM Symposium on Theory of Computing, pp. 82-93, 1980.
2. H. Attiya, M. Snir and M. Warmuth, "Computing on an Anonymous Ring," Journal of the ACM, Vol. 35, No. 4, pp. 845-875, 1988.
3. P. Boldi and S. Vigna, "An Effective Characterization of Computability in Anonymous Networks," Proceedings of the 15th International Symposium on Distributed Computing, Vol. 2180, pp. 33-47, LNCS, Springer-Verlag, 2001.
4. P. Boldi and S. Vigna, "Fibrations of Graphs," Discrete Mathematics, Vol. 243, pp. 21-66, 2002.
5. J. E. Burns, "A Formal Model for Message Passing Systems," Technical Report TR-91, Department of Computer Science, Indiana University, 1980.
6. J. Chalopin, S. Das and N. Santoro, "Groupings and Pairings in Anonymous Networks," Proceedings of the 20th International Symposium on Distributed Computing, Vol. 4167, pp. 105-119, LNCS, Springer-Verlag, 2006.
7. S. Dobrev and A. Pelc, "Leader Election in Rings with Nonunique Labels," Fundamenta Informaticae, Vol. 59, No. 4, pp. 333-347, 2004.
8. P. Flocchini, E. Kranakis, D. Krizanc, F. L. Luccio and N. Santoro, "Sorting and Election in Anonymous Asynchronous Rings," Journal of Parallel and Distributed Computing, Vol. 64, No. 2, pp. 254-265, 2004.
9. D. Hirschberg and J. B. Sinclair, "Decentralized Extrema-Finding in Circular Configurations of Processes," Communications of the ACM, Vol. 23, No. 11, pp. 627-628, 1980.
10. F. T. Leighton, "Finite Common Coverings of Graphs," Journal of Combinatorial Theory (Series B), Vol. 33, pp. 231-238, 1982.
11. G. LeLann, "Distributed Systems - Towards a Formal Approach," Information Processing 77, Proceedings of the IFIP Congress, pp. 155-160, 1977.
12. M. Yamashita and T. Kameda, "Computing on Anonymous Networks, Part I: Characterizing the Solvable Cases," IEEE Transactions on Parallel and Distributed Systems, Vol. 7, No. 1, pp. 69-89, 1996.
13. M. Yamashita and T. Kameda, "Computing on Anonymous Networks, Part II: Decision and Membership Problems," IEEE Transactions on Parallel and Distributed Systems, Vol. 7, No. 1, pp. 90-96, 1996.
14. M. Yamashita and T. Kameda, "Computing Functions on Asynchronous Anonymous Networks," Mathematical Systems Theory, Vol. 29, No. 4, pp. 331-356, 1998. Erratum in Theory of Computing Systems, Vol. 31, No. 1, pp. 109, 1998.
15. M. Yamashita and T. Kameda, "Leader Election Problem on Networks in Which Processor Identity Numbers are not Distinct," IEEE Transactions on Parallel and Distributed Systems, Vol. 10, No. 9, pp. 878-887, 1999.