Reachability in parallel programs is polynomial in the number of threads-Reference-Cited by-同舟云学术

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

Reachability in parallel programs is polynomial in the number of threads

Published:2022-04 Issue: Volume:162 Page:1-16
ISSN:0743-7315
Container-title:Journal of Parallel and Distributed Computing
language:en
Short-container-title:Journal of Parallel and Distributed Computing

Author:

Malkis Alexander

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference88 articles.

1. Subcubic equivalences between graph centrality problems, APSP and diameter;Abboud,2015

2. General decidability theorems for infinite-state systems;Abdulla,1996

3. All for the price of few;Abdulla,2013

4. On the exponent of the all pairs shortest path problem;Alon;J. Comput. Syst. Sci.,1997

5. Northeast blackout likely to reduce US earnings by $6.4 billion;Anderson,2003

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

1. Efficient Management and Scheduling of Massive Remote Sensing Image Datasets;ISPRS International Journal of Geo-Information;2023-05-13

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP