activity
20192021
most citedString Matching with Wildcards in the Massively Parallel Computation Model

5 citations · 6 across the 3 of their papers we have counts for

collaborators
Showing 2021Show all

1 paper · 1 filter

cs.DS2021★ 1 cited

Approximation Algorithms for LCS and LIS with Truly Improved Running Times

Aviad Rubinstein, Saeed Seddighin, Zhao Song +1

Longest common subsequence () is a classic and central problem in combinatorial optimization. While admits a quadratic time solution, recent evidence s…