Soheil Behnezhad
Assistant Professor

Education
- PhD in Computer Science, University of Maryland
- BSc in Software Engineering, Sharif University of Technology — Iran
Biography
Bio coming soon!
Recent publications
-
[TEST-FEB13]-Massively Parallel Minimum Spanning Tree in General Metric Spaces
Citation: Amir Azarmehr, Soheil Behnezhad, Rajesh Jayaram, Jakub Lacki, Vahab Mirrokni, Peilin Zhong. (2025). Massively Parallel Minimum Spanning Tree in General Metric Spaces SODA, 143-174. https://doi.org/10.1137/1.9781611978322.5 -
TEST Fully Dynamic (Δ + 1)-Coloring Against Adaptive Adversaries
Citation: Soheil Behnezhad, Rajmohan Rajaraman, Omer Wasim. (2025). Fully Dynamic (Δ + 1)-Coloring Against Adaptive Adversaries SODA, 4983-5026. https://doi.org/10.1137/1.9781611978322.169 -
[TEST-FEB13]-Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams
Citation: Sepehr Assadi, Soheil Behnezhad, Christian Konrad , Kheeran K. Naidu, Janani Sundaresan. (2025). Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams SODA, 864-904. https://doi.org/10.1137/1.9781611978322.25