The group isomorphism problem determines whether two groups, given by th...
A geometric graph associated with a set of points P= {x_1, x_2, ⋯, x_n
}...
Longest common subsequence (𝖫𝖢𝖲) is a classic and central problem
in com...
We provide universally-optimal distributed graph algorithms for
(1+ε)-ap...
We study distributed algorithms built around edge contraction based vert...
We investigate whether there are inherent limits of parallelization in t...
We present a deterministic fully dynamic algorithm for c-edge connectivi...
Longest common subsequence (LCS) is one of the most fundamental problems...
This paper considers k-means clustering in the presence of noise. It is
...
We study distributed algorithms for string matching problem in presence ...
In this paper we study the problem of dynamically maintaining graph
prop...
A fundamental question that shrouds the emergence of massively parallel
...
This article considers algorithmic and statistical aspects of linear
reg...
We give a highly efficient "semi-agnostic" algorithm for learning univar...