10 citations · 13 across the 6 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.DS2023
Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization
Daniel Gibney, Ce Jin, Tomasz Kociumaka +1
Classically, the edit distance of two length- strings can be computed in time, whereas an -time procedure would falsify the Orthogonal Vectors Hypothesis. I…
cs.DS2023★ 2 cited
Compressibility-Aware Quantum Algorithms on Strings
Daniel Gibney, Sharma V. Thankachan
Sublinear time quantum algorithms have been established for many fundamental problems on strings. This work demonstrates that new, faster quantum algorithms can be designed when th…