research
∙
07/26/2023
HUGE: Huge Unsupervised Graph Embeddings with TPUs
Graphs are a representation of structured data that captures the relatio...
share
research
∙
03/21/2023
Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries
In fully dynamic clustering problems, a clustering of a given data set i...
research
∙
03/27/2022
Approximately Counting Subgraphs in Data Streams
Estimating the number of subgraphs in data streams is a fundamental prob...
research
∙
02/23/2022
Constant matters: Fine-grained Complexity of Differentially Private Continual Observation
We study fine-grained error bounds for differentially private algorithms...
research
∙
12/14/2021
On fully dynamic constant-factor approximation algorithms for clustering problems
Clustering is an important task with applications in many fields of comp...
research
∙
06/28/2021
Differentially Private Algorithms for Graphs Under Continual Observation
Differentially private algorithms protect individuals in data analysis s...
research
∙
11/13/2020
Consistent k-Clustering for General Metrics
Given a stream of points in a metric space, is it possible to maintain a...
research
∙
05/04/2020
Sampling Arbitrary Subgraphs Exactly Uniformly in Sublinear Time
We present a simple sublinear-time algorithm for sampling an arbitrary s...
research
∙
05/05/2019
Testable Properties in General Graphs and Random Order Streaming
We present a novel framework closely linking the areas of property testi...
research
∙
12/21/2018
Testing Stability Properties in Graphical Hedonic Games
In hedonic games, players form coalitions based on individual preference...
research
∙
11/07/2018
Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty
One of the most fundamental questions in graph property testing is to ch...
research
∙
10/11/2018