Factorial Lower Bounds for (Almost) Random Order Streams

Author:

Chiplunkar Ashish1,Kallaugher John2,Kapralov Michael3,Price Eric4

Affiliation:

1. IIT Delhi,Delhi,India

2. Sandia National Labs,Albuquerque,USA

3. EPFL,Lausanne,Switzerland

4. UT Austin,Austin,USA

Funder

Sandia National Laboratories

U.S. Department of Energy

Publisher

IEEE

Reference30 articles.

1. A simple, space-efficient, streaming algorithm for matchings in low arboricity graphs;mcgregor;1st Symposium on Simplicity in Algorithms SOSA 2018 January 7-10 2018 New Orleans LA USA ser OASICS,2018

2. On estimating maximum matching size in graph streams;assadi;Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms,2017

3. Planar matching in streams revisited;mcgregor;Approximation Randomization and Combinatorial Optimization Algorithms and Techniques APPROX/RANDOM 2016 September 7-9 2016 Paris France ser LIPIcs,2016

4. Structural Results on Matching Estimation with Applications to Streaming

5. The influence of variables on Boolean functions

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

1. Sketching Approximability of All Finite CSPs;Journal of the ACM;2024-04-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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