Local Computation Algorithms for Graphs of Non-constant Degrees-Reference-Cited by-同舟云学术

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

Local Computation Algorithms for Graphs of Non-constant Degrees

Published:2016-02-02 Issue:4 Volume:77 Page:971-994
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Levi Reut^ORCID,Rubinfeld Ronitt,Yodpinyanee Anak

Funder

Israel Science Foundation

National Science Foundation

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00453-016-0126-y.pdf

Reference41 articles.

1. Ailon, N., Chazelle, B., Comandur, S., Liu, D.: Property-preserving data reconstruction. Algorithmica 51(2), 160–182 (2008)

2. Alon, N.: A parallel algorithmic version of the local lemma. Random Struct. Algorithms 2(4), 367–378 (1991)

3. Alon, N., Babai, L., Itai, A.: A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms 7(4), 567–583 (1986)

4. Alon, N., Rubinfeld, R., Vardi, S., Xie, N.: Space-efficient local computation algorithms. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1132–1139. SIAM (2012)

5. Andersen, R., Chung, F., Lang, K.: Local graph partitioning using pagerank vectors. In: Foundations of Computer Science, 2006. FOCS’06. 47th Annual IEEE Symposium on, pp. 475–486. IEEE (2006)

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

1. Local Computation Algorithms for Maximum Matching: New Lower Bounds;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

2. Agnostic proper learning of monotone functions: beyond the black-box correction barrier;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

3. Average Sensitivity of Graph Algorithms;SIAM Journal on Computing;2023-08-14

4. Local Computation of Maximal Independent Set;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10

5. Properly learning monotone functions via local correction;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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