On the Locality of Some NP-Complete Problems-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

On the Locality of Some NP-Complete Problems

Published:2012 Issue: Volume: Page:403-415
ISSN:0302-9743
Container-title:Automata, Languages, and Programming
language:
Short-container-title:

Author:

Barenboim Leonid

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-31585-5_37.pdf

Reference22 articles.

1. Awerbuch, B., Goldberg, A.V., Luby, M., Plotkin, S.: Network decomposition and locality in distributed computation. In: Proc. 30th IEEE Symp. on Foundations of Computer Science, pp. 364–369 (October 1989)

2. Barenboim, L.: On the locality of some NP-complete problems (2012), http://arXiv.org/abs/1204.6675

3. Barenboim, L., Elkin, M.: Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition. In: Proc. 27th ACM Symp. on Principles of Distributed Computing, pp. 25–34 (2008)

4. Barenboim, L., Elkin, M.: Distributed (Δ + 1)-coloring in linear (in Δ) time. In: Proc. 41st ACM Symp. on Theory of Computing, pp. 111–120 (2009)

5. Barenboim, L., Elkin, M.: Deterministic distributed vertex coloring in polylogarithmic time. In: Proc. 29th ACM Symp. on Principles of Distributed Computing, pp. 410–419 (2010)

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

1. No Distributed Quantum Advantage for Approximate Graph Coloring;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Faster Deterministic Distributed MIS and Approximate Matching;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

3. Distributed minimum vertex coloring and maximum independent set in chordal graphs;Theoretical Computer Science;2022-06

4. Distributed strong diameter network decomposition;Theoretical Computer Science;2022-06

5. Smaller Cuts, Higher Lower Bounds;ACM Transactions on Algorithms;2021-10-31

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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