Author:
Andoni Alexandr,Krauthgamer Robert,Onak Krzysztof
Cited by
52 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Optimal Algorithms for Bounded Weighted Edit Distance;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
2. Approximating Edit Distance in the Fully Dynamic Model;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
3. Recovery From Non-Decomposable Distance Oracles;IEEE Transactions on Information Theory;2023-10
4. Approximating Binary Longest Common Subsequence in Almost-Linear Time;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
5. Weighted Edit Distance Computation: Strings, Trees, and Dyck;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02