Message lower bounds via efficient network synchronization

摘要

We present a uniform approach to derive message-time tradeoffs and message lower bounds for synchronous distributed computations using results from communication complexity theory.