Sciweavers

WDAG
2001
Springer

An Effective Characterization of Computability in Anonymous Networks

14 years 4 months ago
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).
Paolo Boldi, Sebastiano Vigna
Added 30 Jul 2010
Updated 30 Jul 2010
Type Conference
Year 2001
Where WDAG
Authors Paolo Boldi, Sebastiano Vigna
Comments (0)