Computing anonymously with arbitrary knowledge
Paolo Boldi, Sebastiano Vigna · 1999
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).Perniission to make digital or hard copies of all or part of this work for ~~ersuna~ or ciassroom use is granted without fee probided that copies arc not m&c or distributed for prolit or commercial adcmtagc and that topics bear this notice and the full citation on the first page.TO copy otherwise.