@inproceedings{Moran1986GapTF,
title={Gap Theorems for Distributed Computation},
author={Shlomo Moran and Manfred K. Warmuth},
booktitle={PODC},
year={1986}
}

Consider a bidirectional ring of n identical processors that communicate asynchronously. The processors have no identifiers and hence the ring is called anonymous. Each processor receives an input letter, and the ring is to compute a function of the circular input string. If the function value is constant for all input strings, then the processors do not need to send any messages. On the other hand, we prove that any deterministic algorithm that computes any non-constant function for anonymous… CONTINUE READING