Recent Advances in Multi-Pass Graph Streaming Lower Bounds
Author:
Affiliation:
1. Rutgers University, New Brunswick , NJ, USA
Abstract
Publisher
Association for Computing Machinery (ACM)
Subject
General Materials Science
Link
https://dl.acm.org/doi/pdf/10.1145/3623800.3623808
Reference116 articles.
1. [ABB+19] Sepehr Assadi , MohammadHossein Bateni , Aaron Bernstein , Vahab S. Mirrokni , and Cliff Stein . Coresets meet EDCS: algorithms for matching and vertex cover on massive graphs . In Timothy M. Chan, editor, Proceedings of the Thirtieth Annual ACMSIAM Symposium on Discrete Algorithms, SODA 2019 , San Diego, California, USA , January 6--9, 2019, pages 1616 -- 1635 . SIAM , 2019. 1 [ABB+19] Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, Vahab S. Mirrokni, and Cliff Stein. Coresets meet EDCS: algorithms for matching and vertex cover on massive graphs. In Timothy M. Chan, editor, Proceedings of the Thirtieth Annual ACMSIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6--9, 2019, pages 1616--1635. SIAM, 2019. 1
2. [ABKL23] Sepehr Assadi , Soheil Behnezhad , Sanjeev Khanna , and Huan Li . On regularity lemma and barriers in streaming and dynamic matching. In Barna Saha and Rocco A. Servedio, editors , Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023 , Orlando, FL, USA, June 20--23 , 2023 , pages 131 -- 144 . ACM, 2023. 12, 13, 15 [ABKL23] Sepehr Assadi, Soheil Behnezhad, Sanjeev Khanna, and Huan Li. On regularity lemma and barriers in streaming and dynamic matching. In Barna Saha and Rocco A. Servedio, editors, Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20--23, 2023, pages 131--144. ACM, 2023. 12, 13, 15
3. A tutorial review;Ahmed Abu Reyan;Comput. Sci. Rev.,2020
4. [ACK19a] Sepehr Assadi , Yu Chen , and Sanjeev Khanna . Polynomial pass lower bounds for graph streaming algorithms . In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019 , Phoenix, AZ, USA, June 23--26 , 2019 , pages 265 -- 276 , 2019. 6, 7, 10, 11 [ACK19a] Sepehr Assadi, Yu Chen, and Sanjeev Khanna. Polynomial pass lower bounds for graph streaming algorithms. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23--26, 2019, pages 265--276, 2019. 6, 7, 10, 11
5. [ACK19b] Sepehr Assadi , Yu Chen , and Sanjeev Khanna . Sublinear algorithms for (? + 1) vertex coloring . In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019 , San Diego, California, USA, January 6--9 , 2019 , pages 767 -- 786 , 2019. 1 [ACK19b] Sepehr Assadi, Yu Chen, and Sanjeev Khanna. Sublinear algorithms for (? + 1) vertex coloring. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6--9, 2019, pages 767--786, 2019. 1
Cited by 1 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
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3