We study the equivalence testing problem where the goal is to determine ...
Ranking algorithms find extensive usage in diverse areas such as web sea...
Given a Boolean formula ϕ over n variables, the problem of model
countin...
We study the classical metric k-median clustering problem over a set of
...
We consider the problem of estimating the support size of a distribution...
In this paper, we consider reachability oracles and reachability preserv...
We consider an approximate version of the trace reconstruction
problem, ...
We study approximation algorithms for variants of the median string
prob...
The problem of finding longest common subsequence (LCS) is one of the
fu...
In this paper, we consider the question of computing sparse subgraphs fo...
Edit distance is a measure of similarity of two strings based on the min...
We consider the approximate pattern matching problem under edit distance...
A quasi-Gray code of dimension n and length ℓ over an alphabet
Σ is a se...
The conjectured hardness of Boolean matrix-vector multiplication has bee...