research
∙
09/08/2021
Adversarially Robust Streaming via Dense–Sparse Trade-offs
A streaming algorithm is adversarially robust if it is guaranteed to per...
share
research
∙
02/18/2020
Dynamic Graph Algorithms with Batch Updates in the Massively Parallel Computation Model
We study dynamic graph algorithms in the Massively Parallel Computation ...
research
∙
07/11/2019
Walking Randomly, Massively, and Efficiently
We introduce an approach that enables for efficiently generating many in...
research
∙
02/10/2019
Scalable Fair Clustering
We study the fair variant of the classic k-median problem introduced by ...
research
∙
08/30/2018
Fully Dynamic MIS in Uniformly Sparse Graphs
We consider the problem of maintaining a maximal independent set (MIS) i...
research
∙
07/23/2018
Round Compression for Parallel Graph Algorithms in Strongly Sublinear Space
The Massive Parallel Computation (MPC) model is a theoretical framework ...
research
∙
06/26/2018
Fully Dynamic Maximal Independent Set with Sublinear in n Update Time
The first fully dynamic algorithm for maintaining a maximal independent ...
research
∙
02/27/2018
