Distributed and Streaming Linear Programming in Low Dimensions
Author:
Affiliation:
1. Princeton University, Princeton, NJ, USA
2. Indiana University Bloomington, Bloomington, IN, USA
Funder
National Science Foundation
Simons Foundation Algorithms and Geometry Collaboration
Publisher
ACM Press
Reference47 articles.
1. Kook Jin Ahn and Sudipto Guha. Linear programming in the semi-streaming model with application to the maximum matching problem. In ICALP 2011, pages 526--538, 2011.
2. Noga Alon, Yossi Matias, and Mario Szegedy. The space complexity of approximating the frequency moments. J. Comput. Syst. Sci., 58(1):137--147, 1999.
3. Molham Aref, Balder ten Cate, Todd J. Green, Benny Kimelfeld, Dan Olteanu, Emir Pasalic, Todd L. Veldhuizen, and Geoffrey Washburn. Design and implementation of the logicblox system. In SIGMOD, pages 1371--1382, 2015.
4. Sepehr Assadi, Sanjeev Khanna, and Yang Li. Tight bounds for single-pass streaming complexity of the set cover problem. In STOC, pages 698--711, 2016.
5. Paul Beame, Paraschos Koutris, and Dan Suciu. Communication steps for parallel query processing. J. ACM, 64(6):40:1--40:58, 2017.
Cited by 4 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Detection of fickle trolls in large-scale online social networks;Journal of Big Data;2022-02-19
2. Almost optimal super-constant-pass streaming lower bounds for reachability;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15
3. Collaborative Top Distribution Identifications with Limited Interaction (Extended Abstract);2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11
4. On the Hardness of Massively Parallel Computation;Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures;2020-07-06
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3