15 citations · 58 across the 17 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.DS2021★ 1 cited
Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions
Lijie Chen, Ce Jin, R. Ryan Williams +1
We consider low-space algorithms for the classic Element Distinctness problem: given an array of input integers with bit-length, decide whether or not all elements…
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…