research
∙
05/26/2023
Can You Solve Closest String Faster than Exhaustive Search?
We study the fundamental problem of finding the best string to represent...
share
research
∙
11/22/2022
An Algorithmic Bridge Between Hamming and Levenshtein Distances
The edit distance between strings classically assigns unit cost to every...
research
∙
11/24/2021
Gap Edit Distance via Non-Adaptive Queries: Simple and Optimal
We study the problem of approximating edit distance in sublinear time. T...
research
∙
08/20/2021
Does Preprocessing help in Fast Sequence Comparisons?
We study edit distance computation with preprocessing: the preprocessing...
research
∙
10/02/2019
Sublinear Algorithms for Gap Edit Distance
The edit distance is a way of quantifying how similar two strings are to...
research
∙
08/27/2019
Hardness Amplification of Optimization Problems
In this paper, we prove a general hardness amplification scheme for opti...
research
∙
01/18/2019
Towards a General Direct Product Testing Theorem
The Direct Product encoding of a string a∈{0,1}^n on an underlying domai...
research
∙
10/08/2018