Algebraic Methods in the Congested Clique

Author:

Censor-Hillel Keren1,Kaski Petteri2,Korhonen Janne H.2,Lenzen Christoph3,Paz Ami1,Suomela Jukka4

Affiliation:

1. Technion, Haifa, Israel

2. Helsinki Institute for Information Technology & University of Helsinki, Helsinki, Finland

3. MPI for Informatics, Saarbrücken, Germany

4. Helsinki Institute for Information Technology & Aalto University, Helsinki, Finland

Funder

Seventh Framework Programme

Israel Science Foundation

Publisher

ACM

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

1. Brief Announcement: Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

2. Lenzen’s Distributed Routing Generalized: A Full Characterization of Constant-Time Routability;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

3. On the power of threshold-based algorithms for detecting cycles in the CONGEST model;Theoretical Computer Science;2024-05

4. An O(1)-rounds Deterministic Distributed Approximation Algorithm for the Traveling Salesman Problem in Congested Clique;2024 20th International Conference on Distributed Computing in Smart Systems and the Internet of Things (DCOSS-IoT);2024-04-29

5. A Systematic Survey of General Sparse Matrix-matrix Multiplication;ACM Computing Surveys;2023-03-02

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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