research
∙
05/24/2023
Fairness in Streaming Submodular Maximization over a Matroid Constraint
Streaming submodular maximization is a natural model for the task of sel...
share
research
∙
04/21/2022
Motif Cut Sparsifiers
A motif is a frequently occurring subgraph of a given directed or undire...
research
∙
12/01/2021
Efficient and Local Parallel Random Walks
Random walks are a fundamental primitive used in many machine learning a...
research
∙
07/06/2021
Noisy Boolean Hidden Matching with Applications
The Boolean Hidden Matching (BHM) problem, introduced in a seminal paper...
research
∙
06/09/2021
Streaming Belief Propagation for Community Detection
The community detection problem requires to cluster the nodes of a netwo...
research
∙
06/04/2021
Spectral Hypergraph Sparsifiers of Nearly Linear Size
Graph sparsification has been studied extensively over the past two deca...
research
∙
11/12/2020
Towards Tight Bounds for Spectral Sparsification of Hypergraphs
Cut and spectral sparsification of graphs have numerous applications, in...
research
∙
11/12/2020
Communication Efficient Coresets for Maximum Matching
In this paper we revisit the problem of constructing randomized composab...
research
∙
10/14/2020
Fairness in Streaming Submodular Maximization: Algorithms and Hardness
Submodular maximization has become established as the method of choice f...
research
∙
07/12/2019
Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples
Given a source of iid samples of edges of an input graph G with n vertic...
research
∙
03/28/2019
