An Effective Characterization of Computability in Anonymous Networks

We provide effective (i.e., recursive) characterizations of the relations that can be computed on networks where all processors use the same algorithm, start from the same state, and know at least a bound on the network size. Three activation models are considered (synchronous, asynchronous, interleaved).

• Type: Conference
• Year: 2001
• Where: WDAG
• Authors: Paolo Boldi, Sebastiano Vigna
• Keywords: Algorithms, Characterizations, Network Size, WDAG 2001