Brief Announcement: Upper and Lower Bounds for Edit Distance in Space-Efficient MPC-Reference-Cited by-同舟云学术

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

Brief Announcement: Upper and Lower Bounds for Edit Distance in Space-Efficient MPC

Published:2024-06-17 Issue: Volume:2022 Page:293-295
ISSN:
Container-title:Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Das Debarati¹^ORCID,Gilbert Jacob²^ORCID,Hajiaghayi MohammadTaghi²^ORCID,Kociumaka Tomasz³^ORCID,Saha Barna⁴^ORCID

Affiliation:

1. Pennsylvania State University, State College, Pennsylvania, USA

2. University of Maryland, College Park, Maryland, USA

3. Saarland Informatics Campus, Max Planck Institute for Informatics, Saarbrücken, Germany

4. University of California, San Diego, San Diego, California, USA

Funder

NSF (National Science Foundation)

Army Research Laboratory

Publisher

ACM

Link

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

Reference16 articles.

1. Amir Abboud, Arturs Backurs, and Virginia Vassilevska Williams. 2015a. Tight Hardness Results for LCS and Other Sequence Similarity Measures. In FOCS 2015. 59--78.

2. Amir Abboud, Virginia Vassilevska Williams, and Huacheng Yu. 2015b. Matching Triangles and Basing Hardness on an Extremely Popular Conjecture. In STOC. 41--50.

3. Alexandr Andoni, Robert Krauthgamer, and Krzysztof Onak. 2010. Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity. In FOCS 2010. 377--386.

4. Efficient Parallel Algorithms for String Editing and Related Problems

5. SIAM J. Comput. (2018), 1087--1097;Backurs Arturs

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP