Author:
Bringmann Karl,Kunnemann Marvin
Cited by
91 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. 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
2. Finding maximal exact matches in graphs;Algorithms for Molecular Biology;2024-03-11
3. Computing Longest Common Subsequence Under Cartesian-Tree Matching Model;Lecture Notes in Computer Science;2024
4. Existential Definability over the Subword Ordering;Logical Methods in Computer Science;2023-12-21
5. The Longest Subsequence-Repeated Subsequence Problem;Combinatorial Optimization and Applications;2023-12-09