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


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI