activity
20122024
most citedNew Probabilistic Bounds on Eigenvalues and Eigenvectors of Random Kernel Matrices

1 citations · 1 across the 3 of their papers we have counts for

collaborators
Showing cs.DSShow all

2 papers · 1 filter

cs.DS2018

Stochastic Matching with Few Queries: New Algorithms and Tools

Soheil Behnezhad, Alireza Farhadi, MohammadTaghi Hajiaghayi +1

We consider the following stochastic matching problem on both weighted and unweighted graphs: A graph along with a parameter is given in the input. Each ed…

cs.DS2017

Almost Optimal Stochastic Weighted Matching With Few Queries

Soheil Behnezhad, Nima Reyhani

We consider the {\em stochastic matching} problem. An edge-weighted general (i.e., not necessarily bipartite) graph is given in the input, where each edge in is {\em…