PostDoctoral Research Fellowship

博士后研究奖学金

• 批准号: 2203067
• 负责人: Ray Li
• 金额: $ 15万
• 依托单位: Li, Ray
• 依托单位国家: 美国
• 项目类别: Fellowship Award
• 财政年份: 2022
• 资助国家: 美国
• 起止时间: 2022-09-01 至 2026-08-31
• 项目状态: 未结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=2203067&HistoricalAwards=false
• 关键词: PostDoctoral; Research; Fellowship

This award is made as part of the FY 2022 Mathematical Sciences Postdoctoral Research Fellowships Program. Each of the fellowships supports a research and training project at a host institution in the mathematical sciences, including applications to other disciplines, under the mentorship of a sponsoring scientist.The title of the project for this fellowship to Ray Li is "Coding Theory: Deletions, List decoding, and Beyond." The host institution for the fellowship is the University of California Berkeley, and the sponsoring scientist is Venkatesan Guruswami.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

该奖项是2022财年数学科学博士后研究奖学金计划的一部分。每个奖学金都支持一个主办机构的数学科学研究和培训项目，包括在赞助科学家的指导下应用到其他学科。这个奖学金给Ray Li的项目的标题是《编码理论：删除，列表解码，及更多》。该奖学金的主办机构是加州大学伯克利分校，赞助科学家是Venkatesan Guruswam.这一奖项反映了NSF的法定使命，并通过使用基金会的智力优势和更广泛的影响审查标准进行评估，被认为值得支持。

项目成果

On Diameter Approximation in Directed Graphs

关于有向图中的直径近似

• 发表时间: 2023
• 期刊: Leibniz international proceedings in informatics
• 作者: Abboud, Amir;Dalirrooyfard, Mina;Li, Ray;Vassilevska Williams, Virginia
• 通讯作者: Vassilevska Williams, Virginia

Approximating Binary Longest Common Subsequence in Almost-Linear Time

在几乎线性时间内逼近二进制最长公共子序列

• DOI: 10.1145/3564246.3585104
• 发表时间: 2023
• 期刊: Approximating Binary Longest Common Subsequence in Almost-Linear Time
• 作者: He, Xiaoyu;Li, Ray
• 通讯作者: Li, Ray