An Automatic Speedup Theorem for Distributed Problems

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019.

被引用10|引用|浏览11|DOI:https://doi.org/10.1145/3293611.3331611
EI
其它链接dblp.uni-trier.de|academic.microsoft.com|dl.acm.org|arxiv.org

摘要

Recently, Brandt et al.\ [STOC'16] proved a lower bound for the distributed Lovász Local Lemma, which has been conjectured to be tight for sufficiently relaxed LLL criteria by Chang and Pettie [FOCS'17]. At the heart of their result lies a speedup technique that, for graphs of girth at least 2t+2, transforms any t-round algorithm for one ...更多

代码

数据

下载 PDF 全文
您的评分 :
0

 

标签
评论