No. |
Title |
Author |
Year |
1 |
An Asymptotically Optimal Algorithm for Maximum Matching in Dynamic Streams |
Assadi, Sepehr et al. |
2022 |
2 |
Sublinear Time and Space Algorithms for Correlation Clustering via Sparse-Dense Decompositions |
Assadi, Sepehr et al. |
2022 |
3 |
Beating Two-Thirds For Random-Order Streaming Matching |
Assadi, Sepehr et al. |
2021 |
4 |
Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach |
Assadi, Sepehr et al. |
2021 |
5 |
Graph Connectivity and Single Element Recovery via Linear and OR Queries |
Assadi, Sepehr et al. |
2021 |
6 |
On the Robust Communication Complexity of Bipartite Matching |
Assadi, Sepehr et al. |
2021 |
7 |
Ruling Sets in Random Order and Adversarial Streams |
Assadi, Sepehr et al. |
2021 |
8 |
Improved Bounds for Distributed Load Balancing |
Assadi, Sepehr et al. |
2020 |
9 |
Palette Sparsification Beyond (Δ+1) Vertex Coloring |
Alon, Noga et al. |
2020 |
10 |
When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time |
Assadi, Sepehr et al. |
2019 |
11 |
A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling |
Assadi, Sepehr et al. |
2018 |
12 |
Towards a Unified Theory of Sparsification for Matching Problems |
Assadi, Sepehr et al. |
2018 |
13 |
Algorithms for Provisioning Queries and Analytics |
Assadi, Sepehr et al. |
2016 |
14 |
Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches |
Assadi, Sepehr et al. |
2015 |