The following pages link to Sepehr Assadi (Q487028):
Displaying 29 items.
- The minimum vulnerability problem (Q487032) (← links)
- On the rectangle escape problem (Q2402267) (← links)
- Fast Convergence in the Double Oral Auction (Q3460777) (← links)
- On Estimating Maximum Matching Size in Graph Streams (Q4575856) (← links)
- (Q4608050) (← links)
- The Minimum Vulnerability Problem (Q4909555) (← links)
- Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem (Q4997308) (← links)
- Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions (Q5071085) (← links)
- A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling (Q5090376) (← links)
- When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time (Q5091165) (← links)
- Separating the communication complexity of truthful and non-truthful combinatorial auctions (Q5144993) (← links)
- Exploration with limited memory: streaming algorithms for coin tossing, noisy comparisons, and multi-armed bandits (Q5145007) (← links)
- Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs (Q5145258) (← links)
- Polynomial pass lower bounds for graph streaming algorithms (Q5212768) (← links)
- Fully dynamic maximal independent set with sublinear update time (Q5230340) (← links)
- Stochastic Submodular Cover with Limited Adaptivity (Q5236202) (← links)
- Sublinear Algorithms for (Δ + 1) Vertex Coloring (Q5236231) (← links)
- Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs (Q5236282) (← links)
- Fully Dynamic Maximal Independent Set with Sublinear in <i>n</i> Update Time (Q5236302) (← links)
- Algorithms for Provisioning Queries and Analytics (Q5276198) (← links)
- Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches (Q5278310) (← links)
- Tight bounds for single-pass streaming complexity of the set cover problem (Q5361872) (← links)
- Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets (Q5855210) (← links)
- Graph connectivity and single element recovery via linear and OR queries (Q6052041) (← links)
- Ruling Sets in Random Order and Adversarial Streams (Q6061690) (← links)
- On the Robust Communication Complexity of Bipartite Matching (Q6070391) (← links)
- Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach. (Q6075891) (← links)
- (Q6084349) (← links)
- (Q6126232) (← links)
