2 citations · 3 across the 2 of their papers we have counts for
3 papers
cs.DS2021★ 1 cited
Near-Optimal Quantum Algorithms for String Problems
Shyan Akmal, Ce Jin
We study quantum algorithms for several fundamental string problems, including Longest Common Substring, Lexicographically Minimal String Rotation, and Longest Square Substring. Th…
cs.DS2021★ 2 cited
Faster Algorithms for Bounded Tree Edit Distance
Shyan Akmal, Ce Jin
Tree edit distance is a well-studied measure of dissimilarity between rooted trees with node labels. It can be computed in time [Demaine, Mozes, Rossman, and Weimann, ICAL…
cs.DS2021
Improved Approximation for Longest Common Subsequence over Small Alphabets
Shyan Akmal, Virginia Vassilevska Williams
This paper investigates the approximability of the Longest Common Subsequence (LCS) problem. The fastest algorithm for solving the LCS problem exactly runs in essentially quadratic…