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
37 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Learning locality-sensitive bucketing functions;Bioinformatics;2024-06-28
2. Brief Announcement: Upper and Lower Bounds for Edit Distance in Space-Efficient MPC;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17
3. On the Communication Complexity of Approximate Pattern Matching;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
4. Almost Linear Size Edit Distance Sketch;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
5. Finding maximal exact matches in graphs;Algorithms for Molecular Biology;2024-03-11