A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is
We consider deterministic anonymous distributed systems with broadcast communications where each node has some initial value, and the goal is to compute a function of all these values. We show that only a very restricted set of functions can be computed if the nodes do not know (and cannot use) the number of their out-neighbors. Our results remain valid even if nodes know the precise structure of the network but do not know where they lie within the structure. They also remain valid if nodesdoi:10.1109/allerton.2015.7446980 dblp:conf/allerton/HendrickxT15 fatcat:4jfsm2xk2fgvngwptsfnolfdsi