We study statistical/computational tradeoffs for the following density
e...
We introduce and study the communication complexity of computing the inn...
Longest Increasing Subsequence (LIS) is a fundamental statistic of a
seq...
The indexing algorithms for the high-dimensional nearest neighbor search...
In this note, we show that one can use average embeddings, introduced
re...
We study the space complexity of solving the bias-regularized SVM proble...
We present an algorithm for approximating the edit distance between two
...
We present a (1+ε)-approximate parallel algorithm for computing
shortest...
Many modern parallel systems, such as MapReduce, Hadoop and Spark, can b...
We study the problem of discrete distribution testing in the two-party
s...
We study sublinear algorithms that solve linear systems locally. In
the ...
We introduce a batch version of sparse recovery, where the goal is to
re...
The nearest neighbor problem is defined as follows: Given a set P of n
p...
We consider a generalization of the classic linear regression problem to...
We study graph connectivity problem in MPC model. On an undirected graph...