research
∙
12/15/2021
Approximating the Longest Common Subsequence problem within a sub-polynomial factor in linear time
The Longest Common Subsequence (LCS) of two strings is a fundamental str...
share
research
∙
12/09/2021
Estimating the Longest Increasing Subsequence in Nearly Optimal Time
Longest Increasing Subsequence (LIS) is a fundamental statistic of a seq...
research
∙
05/15/2020
Edit Distance in Near-Linear Time: it's a Constant Factor
We present an algorithm for approximating the edit distance between two ...
research
∙
11/09/2018