An effective characterization of computability in anonymous networks

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

Volumn 2180, Issue , 2001, Pages 33-47

  Boldi, Paolo ^a   Vigna, Sebastiano ^a  

^a UNIVERSITY OF MILAN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ACTIVATION MODELS; ANONYMOUS NETWORKS; NETWORK SIZE;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84957017428     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45414-4_3     Document Type: Conference Paper

References (15)

1. Dana Angluin. Local and global properties in networks of processors. In Proc. 12th Symposium on the Theory of Computing, pages 82–93, 1980.
2. Nechama Allenberg-Navony, Alon Itai, and Shlomo Moran. Average and randomized complexity of distributed problems. SIAM Journal on Computing, 25(6):1254–1267, 1996.
3. Hagit Attiya, Marc Snir, and Manfred K. Warmuth. Computing on an anonymous ring. J. Assoc. Comput. Mach., 35(4):845–875, 1988.
4. Paolo Boldi, Bruno Codenotti, Peter Gemmell, Shella Shammah, Janos Simon, and Sebastiano Vigna. Symmetry breaking in anonymous networks: Characterizations. In Proc. 4th Israeli Symposium on Theory of Computing and Systems, pages 16–26. IEEE Press, 1996.
5. Paolo Boldi and Sebastiano Vigna. Fibrations of graphs. Discrete Math. To appear.
6. Paolo Boldi and Sebastiano Vigna. Computing vector functions on anonymous networks. In Danny Krizanc and PeterWidmayer, editors, SIROCCO’97. Proc. 4th International Colloquium on Structural Information and Communication Complexity, volume 1 of Proceedings in Informatics, pages 201–214. Carleton Scientific, 1997. An extended abstract appeared also as a Brief Announcement in Proc. PODC’97, ACM Press.
7. Paolo Boldi and Sebastiano Vigna. Self-stabilizing universal algorithms. In Sukumar Ghosh and Ted Herman, editors, Self–Stabilizing Systems (Proc. Of the 3rd Workshop on Self–Stabilizing Systems, Santa Barbara, California, 1997), volume 7 of International Informatics Series, pages 141–156. Carleton University Press, 1997.
8. Paolo Boldi and Sebastiano Vigna. Computing anonymously with arbitrary knowledge. In Proc. 18th ACMSymposium on Principles of Distributed Computing, pages 181–188. ACM Press, 1999.
9. Krzysztof Diks, Evangelos Kranakis,Adam Malinowski, and Andrzej Pelc. Anonymous wireless rings. Theoret. Comput. Sci., 145:95–109, 1995.
10. Ralph E. Johnson and Fred B. Schneider. Symmetry and similarity in distributed systems. In Proc. 4th conference on Principles of Distributed Computing, pages 13–22, 1985.
11. Nancy Norris. Computing functions on partially wireless networks. In Lefteris M. Kirousis and Evangelos Kranakis, editors, Structure, Information and Communication Complexity. Proc. 2nd Colloquium SIROCCO’95, volume 2 of International Informatics Series, pages 53–64. Carleton University Press, 1996.
12. Moni Naor and Larry Stockmeyer. What can be computed locally? SIAM J. Comput., 24(6):1259–1277, 1995.
13. Sandeep K. Shukla, Daniel J. Rosenkrantz, and S.S. Ravi. Observations on selfstabilizing graph algorithms for anonymous networks. In Proceedings of the Second Workshop on Self-Stabilizing Systems, pages 7.1–7.15, Las Vegas, 1995. University of Nevada.
14. Masafumi Yamashita and Tiko Kameda. Computing on anonymous networks: Part I—characterizing the solvable cases. IEEE Trans. Parallel and Distributed Systems, 7(1):69–89, 1996.
15. Masafumi Yamashita and Tiko Kameda. Erratum to computing functions on asynchronous anonymous networks. Theory of Computing Systems (formerly Math. Systems Theory), 31(1), 1998.