Author:
Backurs Arturs,Indyk Piotr
Funder
Center for Massive Data Algorithmics
International Business Machines Corporation
National Science Foundation
Simons Foundation
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Subject
General Mathematics,General Computer Science
Cited by
32 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Theoretical Analysis of Edit Distance Algorithms;Communications of the ACM;2023-11-17
2. Breaking the Cubic Barrier for (Unweighted) Tree Edit Distance;SIAM Journal on Computing;2023-11-16
3. Optimal Algorithms for Bounded Weighted Edit Distance;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
4. Approximating Edit Distance in the Fully Dynamic Model;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
5. Absent Subsequences in Words;Fundamenta Informaticae;2023-10-26