We consider the problem of computing differentially private approximate
...
Estimating the support size of a distribution is a well-studied problem ...
Sampling edges from a graph in sublinear time is a fundamental problem a...
The exponential increase in the amount of available data makes taking
ad...
Important graph mining problems such as Clustering are computationally
d...
In classical statistics and distribution testing, it is often assumed th...
The famous k-means++ algorithm of Arthur and Vassilvitskii [SODA 2007] i...
While algorithms for planar graphs have received a lot of attention, few...
Given a large set U where each item a∈ U has weight w(a), we want to
est...
We consider the problems of sampling and counting edges from a graph on ...
There is a trivial O(n^3/T) time algorithm for approximate triangle
coun...
In this paper, we revisit the classic CountSketch method, which is a spa...
Self-modification of agents embedded in complex environments is hard to
...
The area of sublinear algorithms have recently received a lot of attenti...
Compact and I/O-efficient data representations play an important role in...
While FPGAs have been used extensively as hardware accelerators in indus...
Simultaneous Embedding with Fixed Edges (SEFE) is a problem where given ...