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