Author:
Abboud Amir,Backurs Arturs,Williams Virginia Vassilevska
Funder
International Business Machines Corporation
National Science Foundation
Simons Foundation
Stanford University
United States - Israel Binational Science Foundation
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Subject
General Mathematics,General Computer Science
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Fine-Grained Complexity of Regular Path Queries;Logical Methods in Computer Science;2023-11-27
2. Weighted Edit Distance Computation: Strings, Trees, and Dyck;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
3. Improved Merlin–Arthur Protocols for Central Problems in Fine-Grained Complexity;Algorithmica;2023-02-17
4. The Fine-Grained Complexity of CFL Reachability;Proceedings of the ACM on Programming Languages;2023-01-09
5. Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10