Hardness of Distributed Optimization

Author:

Bacrach Nir1,Censor-Hillel Keren1,Dory Michal1,Efron Yuval1,Leitersdorf Dean1,Paz Ami2

Affiliation:

1. Technion, Haifa, Israel

2. CNRS & Université de Paris, Paris, France

Funder

Horizon 2020

Israel Science Foundation

United States - Israel Binational Science Foundation

Publisher

ACM

Reference38 articles.

1. Nir Bachrach Keren Censor-Hillel Michal Dory Yuval Efron Dean Leitersdorf and Ami Paz. 2019. Hardness of Distributed Optimization. CoRR Vol. abs/11905.10284 (2019). arxiv: 1905.10284 http://arxiv.org/abs/1905.10284 10.1145/3293611.3331597 Nir Bachrach Keren Censor-Hillel Michal Dory Yuval Efron Dean Leitersdorf and Ami Paz. 2019. Hardness of Distributed Optimization. CoRR Vol. abs/11905.10284 (2019). arxiv: 1905.10284 http://arxiv.org/abs/1905.10284 10.1145/3293611.3331597

2. Ran Ben-Basat Ken-ichi Kawarabayashi and Gregory Schwartzman. 2018. Parameterized Distributed Algorithms. CoRR Vol. abs/1807.04900 (2018). arxiv: 1807.04900 http://arxiv.org/abs/1807.04900 Ran Ben-Basat Ken-ichi Kawarabayashi and Gregory Schwartzman. 2018. Parameterized Distributed Algorithms. CoRR Vol. abs/1807.04900 (2018). arxiv: 1807.04900 http://arxiv.org/abs/1807.04900

3. Aaron Bernstein and Danupon Nanongkai. 2018. Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time. CoRR Vol. abs/1811.03337 (2018). arxiv: 1811.03337 http://arxiv.org/abs/1811.03337 To appear in STOC 2019. 10.1145/3313276.3316326 Aaron Bernstein and Danupon Nanongkai. 2018. Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time. CoRR Vol. abs/1811.03337 (2018). arxiv: 1811.03337 http://arxiv.org/abs/1811.03337 To appear in STOC 2019. 10.1145/3313276.3316326

Cited by 22 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. (Δ+1) Vertex Coloring in O ( n ) Communication;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17

2. On Distributed Computation of the Minimum Triangle Edge Transversal;Lecture Notes in Computer Science;2024

3. Recent Advances in Multi-Pass Graph Streaming Lower Bounds;ACM SIGACT News;2023-09-07

4. Why Extension-Based Proofs Fail;SIAM Journal on Computing;2023-07-25

5. The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3