Skip to content

Author

Soheil Behnezhad

3 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Nov 2026

Generalized Sorting via Four-Cycles

We study the generalized sorting problem where only a subset of the pairs can be compared. Equivalently, we are given an $n$-vertex $m$-edge graph $G=(V, E)$ where the vertex set $V$ is to be sorted, and the edge set $E$ indicates possible comparisons. The goal is to sort $V$ with as few (adaptive) queries to $E$ as po...

Soheil Behnezhad, Shane Ferrante · 0 citations
Preprint Nov 2026

Stochastic Matching with Polynomial Degree

We study the stochastic matching problem, where a graph $G$ is known in advance, but each edge survives independently with probability $p$. The goal is to select a subgraph $H$ of small maximum degree before seeing the surviving edges, while preserving a $(1-\epsilon)$ fraction of the expected maximum matching size. Th...

Soheil Behnezhad · 0 citations
Preprint Aug 2026

Streaming Algorithms for Monotonicity Testing

The main result is an algorithm that $(1+\epsilon)$-approximates distance to monotonicity in $\sqrt{n}^{1+o(1)}$ passes, and it is proved that this is the best pass-complexity one can hope for, for any $O(1)$-approximation, short of improving the state-of-the-art streaming algorithm for st-reachability.

Amir Azarmehr, Soheil Behnezhad, Lily Chung et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.