research
∙
01/06/2023
Better Differentially Private Approximate Histograms and Heavy Hitters using the Misra-Gries Sketch
We consider the problem of computing differentially private approximate ...
share
research
∙
11/21/2022
Estimating the Effective Support Size in Constant Query Complexity
Estimating the support size of a distribution is a well-studied problem ...
research
∙
11/09/2022
Sampling an Edge in Sublinear Time Exactly and Optimally
Sampling edges from a graph in sublinear time is a fundamental problem a...
research
∙
11/07/2022
Additive Noise Mechanisms for Making Randomized Approximation Algorithms Differentially Private
The exponential increase in the amount of available data makes taking ad...
research
∙
08/24/2022
ProbGraph: High-Performance and High-Accuracy Graph Mining with Probabilistic Set Representations
Important graph mining problems such as Clustering are computationally d...
research
∙
08/02/2022
Bias Reduction for Sum Estimation
In classical statistics and distribution testing, it is often assumed th...
research
∙
07/16/2022
A Nearly Tight Analysis of Greedy k-means++
The famous k-means++ algorithm of Arthur and Vassilvitskii [SODA 2007] i...
research
∙
04/19/2022
Massively Parallel Computation and Sublinear-Time Algorithms for Embedded Planar Graphs
While algorithms for planar graphs have received a lot of attention, few...
research
∙
10/28/2021
Better Sum Estimation via Weighted Sampling
Given a large set U where each item a∈ U has weight w(a), we want to est...
research
∙
07/08/2021
Sampling and Counting Edges via Vertex Accesses
We consider the problems of sampling and counting edges from a graph on ...
research
∙
04/17/2021
Approximate Triangle Counting via Sampling and Fast Matrix Multiplication
There is a trivial O(n^3/T) time algorithm for approximate triangle coun...
research
∙
02/03/2021
CountSketches, Feature Hashing and the Median of Three
In this paper, we revisit the classic CountSketch method, which is a spa...
research
∙
11/12/2020
Performance of Bounded-Rational Agents With the Ability to Self-Modify
Self-modification of agents embedded in complex environments is hard to ...
research
∙
09/23/2020
Sampling an Edge Uniformly in Sublinear Time
The area of sublinear algorithms have recently received a lot of attenti...
research
∙
11/16/2018
Compact I/O-Efficient Representation of Separable Graphs and Optimal Tree Layouts
Compact and I/O-efficient data representations play an important role in...
research
∙
07/10/2018
Theoretical Model of Computation and Algorithms for FPGA-based Hardware Accelerators
While FPGAs have been used extensively as hardware accelerators in indus...
research
∙
12/01/2017
