Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets-Reference-Cited by-同舟云学术

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

Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets

Published:2020-07-31 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 39th Symposium on Principles of Distributed Computing
language:
Short-container-title:

Author:

Assadi Sepehr¹,Kol Gillat²,Oshman Rotem³

Affiliation:

1. Rutgers University

2. Princeton University

3. Tel Aviv University

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3382734.3405732

Reference53 articles.

1. Graph sketches

2. Testing subgraphs in large graphs

3. Nearly complete graphs decomposable into large induced matchings and their applications

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

1. O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Coloring Fast with Broadcasts;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17

3. Rounds vs Communication Tradeoffs for Maximal Independent Sets;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10

4. Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs;Lecture Notes in Computer Science;2021

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP