On the complexity of global computation in the presence of link failures
Oded Goldreich, Dror Sneh · 1992
We consider distributed computations in an asynchronous communication model with undetectable link failures. The computational tasks we consider are obtaining the value of a predetermined function of the local inputs scattered in the network (e.g., the sum of all local values). We call this task Global Computation.