research
∙
08/30/2023
Support Testing in the Huge Object Model
The Huge Object model is a distribution testing model in which we are gi...
share
research
∙
12/13/2022
Streaming Euclidean MST to a Constant Factor
We study streaming algorithms for the fundamental geometric problem of c...
research
∙
11/21/2022
Learnable Graph Convolutional Attention Networks
Existing Graph Neural Networks (GNNs) compute the message exchange betwe...
research
∙
11/05/2021
New Streaming Algorithms for High Dimensional EMD and MST
We study streaming algorithms for two fundamental geometric problems: co...
research
∙
11/29/2020
Erasure-Resilient Sublinear-Time Graph Algorithms
We investigate sublinear-time algorithms that take partially erased grap...
research
∙
04/26/2020
Learning and Testing Junta Distributions with Subcube Conditioning
We study the problems of learning and testing junta distributions on {-1...
research
∙
11/17/2019
Random Restrictions of High-Dimensional Distributions and Uniformity Testing with Subcube Conditioning
We give a nearly-optimal algorithm for testing uniformity of distributio...
research
∙
09/07/2019
Hard properties with (very) short PCPPs and their applications
We show that there exist properties that are maximally hard for testing,...
research
∙
07/09/2019
Nearly optimal edge estimation with independent set queries
We study the problem of estimating the number of edges of an unknown, un...
research
∙
11/05/2018
Limits of Ordered Graphs and Images
The emerging theory of graph limits exhibits an interesting analytic per...
research
∙
06/27/2018
Sublinear-Time Quadratic Minimization via Spectral Decomposition of Matrices
We design a sublinear-time approximation algorithm for quadratic functio...
research
∙
05/03/2018