Before revision:  We show that the local information cost  presents a natural lower bound on the communication complexity of distributed algorithms.
After revision:  We show that the local information cost ( presents a natural lower bound on the communication complexity of distributed algorithms.