The following pages link to Soheil Behnezhad (Q2292632):
Displaying 10 items.
- Stochastic matching on uniformly sparse graphs (Q2292635) (← links)
- (Q4608043) (← links)
- Brief Announcement: MapReduce Algorithms for Massive Trees (Q5002852) (← links)
- (Q5075750) (← links)
- Stochastic matching with few queries: (1-ε) approximation (Q5144996) (← links)
- Massively Parallel Computation of Matching and MIS in Sparse Graphs (Q5145260) (← links)
- Fully Dynamic Matching: Beating 2-Approximation in Δ<sup><i>ϵ</i></sup> Update Time (Q5146943) (← links)
- Stochastic Matching with Few Queries: New Algorithms and Tools (Q5236368) (← links)
- On the Robust Communication Complexity of Bipartite Matching (Q6070391) (← links)
- Fast and Simple Solutions of Blotto Games (Q6192834) (← links)
