Message lower bounds via efficient network synchronization.
Theoretical Computer Science（2020）
摘要
We present a uniform approach to derive message-time tradeoffs and message lower bounds for synchronous distributed computations using results from communication complexity theory.
更多查看译文
关键词
Distributed algorithms,Synchronous message-passing,Communication complexity,Lower bounds,Synchronizers
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要