论文信息 - Computing anonymously with arbitrary knowledge

Computing anonymously with arbitrary knowledge

We provide characterizations of the relations that can be computed with arbitrary knowledge on networks where all processors use the same algorithm and start from the same state (in particular, we do not assume that a bound on the network size is known). Three activation models are considered (synchronous, asynchronous, interleaved).

Sebastiano Vigna | Paolo Boldi | P. Boldi | S. Vigna

[1] T. Kameda,et al. Computing functions on asynchronous anonymous networks , 1998, Theory of Computing Systems.

[2] Sebastiano Vigna,et al. Symmetry Breaking in Anonymous Networks: Characterizations , 1996, ISTCS.

[3] Moni Naor,et al. What Can be Computed Locally? , 1995, SIAM J. Comput..

[4] Sebastiano Vigna,et al. Computing vector functions on anonymous networks , 1997, PODC '97.

[5] Sebastiano Vigna,et al. Self-stabilizing universal algorithms , 1997, WSS.

[6] Hagit Attiya,et al. Computing in Totally Anonymous Asynchronous Shared Memory Systems , 1998, DISC.

[7] James Donald Monk. Introduction to set theory , 1969 .

[8] Dana Angluin,et al. Local and global properties in networks of processors (Extended Abstract) , 1980, STOC '80.

[9] Masafumi Yamashita,et al. Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases , 1996, IEEE Trans. Parallel Distributed Syst..

[10] Nancy Norris. Computing Functions on Partially Wireless Networks , 1995, SIROCCO.