On the Multiparty Communication Complexity of Testing Triangle-Freeness-Reference-Cited by-同舟云学术

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

On the Multiparty Communication Complexity of Testing Triangle-Freeness

Published:2017-07-25 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the ACM Symposium on Principles of Distributed Computing
language:
Short-container-title:

Author:

Fischer Orr¹,Gershtein Shay¹,Oshman Rotem¹

Affiliation:

1. Tel Aviv University, Tel Aviv, Israel

Publisher

ACM

Link

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

Reference33 articles.

1. Testing subgraphs in large graphs

2. Noga Alon Eldar Fischer Michael Krivelevich and Mario Szegedy. 2000. Efficient Testing of Large Graphs. Combinatorica 20 4 ( 2000) 451--476. 10.1007/s004930070001 Noga Alon Eldar Fischer Michael Krivelevich and Mario Szegedy. 2000. Efficient Testing of Large Graphs. Combinatorica 20 4 ( 2000) 451--476. 10.1007/s004930070001

3. Testing triangle-freeness in general graphs

4. Testing subgraphs in directed graphs

5. Optimal principal component analysis in distributed and streaming models

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

1. Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11

2. Property testing of planarity in the CONGEST model;Distributed Computing;2020-07-13

3. Property Testing of Planarity in the CONGEST model;Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing;2018-07-23

4. SPAA 2017 Review;ACM SIGACT News;2017-12-13

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP