On the Rectangle Escape Problem. - Sepehr Assadi; Ehsan Emamjomeh-Zadeh; Sadra Yazdanbod; Hamid Zarrabi-Zadeh (CCCG, 2013)

The Minimum Vulnerability Problem. - Sepehr Assadi; Ehsan Emamjomeh-Zadeh; Ashkan Norouzi-Fard; Sadra Yazdanbod; Hamid Zarrabi-Zadeh (Algorithmica, 2014)

Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches. - Sepehr Assadi; Sanjeev Khanna; Yang Li 025; Val Tannen (FSTTCS, 2015)

Online Assignment of Heterogeneous Tasks in Crowdsourcing Markets. - Sepehr Assadi; Justin Hsu; Shahin Jabbari (HCOMP, 2015)

Tight Bounds for Linear Sketches of Approximate Matchings. - Sepehr Assadi; Sanjeev Khanna; Yang Li 025; Grigory Yaroslavtsev (CoRR, 2015)

Algorithms for Provisioning Queries and Analytics. - Sepehr Assadi; Sanjeev Khanna; Yang Li 025; Val Tannen (ICDT, 2016)

Maximum Matchings in Dynamic Graph Streams and the Simultaneous Communication Model. - Sepehr Assadi; Sanjeev Khanna; Yang Li 025; Grigory Yaroslavtsev (SODA, 2016)

A Compile-Time Optimization Method for WCET Reduction in Real-Time Embedded Systems through Block Formation. - Morteza Mohajjel Kafshdooz; Mohammadkazem Taram; Sepehr Assadi; Alireza Ejlali (ACM Trans. Archit. Code Optim., 2016)

Learning with Limited Rounds of Adaptivity: Coin Tossing, Multi-Armed Bandits, and Ranking from Pairwise Comparisons. - Arpit Agarwal; Shivani Agarwal 001; Sepehr Assadi; Sanjeev Khanna (COLT, 2017)

Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem. - Sepehr Assadi (PODS, 2017)

The Stochastic Matching Problem: Beating Half with a Non-Adaptive Algorithm. - Sepehr Assadi; Sanjeev Khanna; Yang Li 025 (EC, 2017)

On Estimating Maximum Matching Size in Graph Streams. - Sepehr Assadi; Sanjeev Khanna; Yang Li 025 (SODA, 2017)

Randomized Composable Coresets for Matching and Vertex Cover. - Sepehr Assadi; Sanjeev Khanna (SPAA, 2017)

Simple Round Compression for Parallel Vertex Cover. - Sepehr Assadi (CoRR, 2017)

SPAA 2017 Review. - Sepehr Assadi (SIGACT News, 2017)

On the rectangle escape problem. - AmirMahdi Ahmadinejad; Sepehr Assadi; Ehsan Emamjomeh-Zadeh; Sadra Yazdanbod; Hamid Zarrabi-Zadeh (Theor. Comput. Sci., 2017)

Fast Convergence in the Double Oral Auction. - Sepehr Assadi; Sanjeev Khanna; Yang Li 025; Rakesh Vohra (ACM Trans. Economics and Comput., 2017)

Tight Bounds on the Round Complexity of the Distributed Maximum Coverage Problem. - Sepehr Assadi; Sanjeev Khanna (SODA, 2018)

Fully dynamic maximal independent set with sublinear update time. - Sepehr Assadi; Krzysztof Onak; Baruch Schieber; Shay Solomon (STOC, 2018)

When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time. - Sepehr Assadi; Shay Solomon (ICALP, 2019)

Distributed Weighted Matching via Randomized Composable Coresets. - Sepehr Assadi; MohammadHossein Bateni; Vahab S. Mirrokni (ICML, 2019)

A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling. - Sepehr Assadi; Michael Kapralov; Sanjeev Khanna (ITCS, 2019)

Secretary Ranking with Minimal Inversions. - Sepehr Assadi; Eric Balkanski; Renato Paes Leme (NeurIPS, 2019)

Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs. - Sepehr Assadi; Xiaorui Sun; Omri Weinstein (PODC, 2019)

Distributed and Streaming Linear Programming in Low Dimensions. - Sepehr Assadi; Nikolai Karpov; Qin Zhang 001 (PODS, 2019)

Stochastic Submodular Cover with Limited Adaptivity. - Arpit Agarwal; Sepehr Assadi; Sanjeev Khanna (SODA, 2019)

Towards a Unified Theory of Sparsification for Matching Problems. - Sepehr Assadi; Aaron Bernstein (SOSA, 2019)

Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs. - Sepehr Assadi; MohammadHossein Bateni; Aaron Bernstein; Vahab S. Mirrokni; Cliff Stein 001 (SODA, 2019)

Sublinear Algorithms for (Δ + 1) Vertex Coloring. - Sepehr Assadi; Yu Chen 039; Sanjeev Khanna (SODA, 2019)

Fully Dynamic Maximal Independent Set with Sublinear in n Update Time. - Sepehr Assadi; Krzysztof Onak; Baruch Schieber; Shay Solomon (SODA, 2019)

Polynomial pass lower bounds for graph streaming algorithms. - Sepehr Assadi; Yu Chen 039; Sanjeev Khanna (STOC, 2019)

The Stochastic Matching Problem with (Very) Few Queries. - Sepehr Assadi; Sanjeev Khanna; Yang Li 025 (ACM Trans. Economics and Comput., 2019)

Palette Sparsification Beyond (Δ+1) Vertex Coloring. - Noga Alon; Sepehr Assadi (APPROX-RANDOM, 2020)

Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems. - Sepehr Assadi; Gillat Kol; Raghuvansh R. Saxena; Huacheng Yu (FOCS, 2020)

Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms. - Sepehr Assadi; Ran Raz (FOCS, 2020)

Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets. - Sepehr Assadi; Gillat Kol; Rotem Oshman (PODC, 2020)

Separating the communication complexity of truthful and non-truthful combinatorial auctions. - Sepehr Assadi; Hrishikesh Khandeparkar; Raghuvansh R. Saxena; S. Matthew Weinberg (STOC, 2020)

Exploration with limited memory: streaming algorithms for coin tossing, noisy comparisons, and multi-armed bandits. - Sepehr Assadi; Chen Wang 027 (STOC, 2020)

Improved Bounds for Distributed Load Balancing. - Sepehr Assadi; Aaron Bernstein; Zachary Langley (DISC, 2020)

Improved truthful mechanisms for combinatorial auctions with submodular bidders. - Sepehr Assadi; Sahil Singla 001 (SIGecom Exch., 2020)

Combinatorial Auctions Do Need Modest Interaction. - Sepehr Assadi (ACM Trans. Economics and Comput., 2020)

On the Robust Communication Complexity of Bipartite Matching. - Sepehr Assadi; Soheil Behnezhad (APPROX-RANDOM, 2021)

Graph Connectivity and Single Element Recovery via Linear and OR Queries. - Sepehr Assadi; Deeparnab Chakrabarty; Sanjeev Khanna (ESA, 2021)

Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach. - Sepehr Assadi; Shay Solomon (ESA, 2021)

Beating Two-Thirds For Random-Order Streaming Matching. - Sepehr Assadi; Soheil Behnezhad (ICALP, 2021)

Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier. - Sepehr Assadi; Thomas Kesselheim; Sahil Singla 001 (SODA, 2021)

A Simple Semi-Streaming Algorithm for Global Minimum Cuts. - Sepehr Assadi; Aditi Dudeja (SOSA, 2021)

An Auction Algorithm for Bipartite Matching in Streaming and Massively Parallel Computation Models. - Sepehr Assadi; S. Cliff Liu; Robert E. Tarjan (SOSA, 2021)

Graph streaming lower bounds for parameter estimation and property testing via a streaming XOR lemma. - Sepehr Assadi; Vishvajeet N (STOC, 2021)

Ruling Sets in Random Order and Adversarial Streams. - Sepehr Assadi; Aditi Dudeja (DISC, 2021)

A Two-Pass Lower Bound for Semi-Streaming Maximum Matching. - Sepehr Assadi (CoRR, 2021)

Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem. - Sepehr Assadi; Sanjeev Khanna; Yang Li 025 (SIAM J. Comput., 2021)

Asymptotically Optimal Bounds for Estimating H-Index in Sublinear Time with Applications to Subgraph Counting. - Sepehr Assadi; Hoai-An Nguyen (APPROX/RANDOM, 2022)

Hierarchical Clustering in Graph Streams: Single-Pass Algorithms and Space Lower Bounds. - Sepehr Assadi; Vaggos Chatziafratis; Jakub Lacki; Vahab Mirrokni; Chen Wang 027 (COLT, 2022)

Decremental Matching in General Graphs. - Sepehr Assadi; Aaron Bernstein; Aditi Dudeja (ICALP, 2022)

Sublinear Time and Space Algorithms for Correlation Clustering via Sparse-Dense Decompositions. - Sepehr Assadi; Chen Wang 027 (ITCS, 2022)

An Asymptotically Optimal Algorithm for Maximum Matching in Dynamic Streams. - Sepehr Assadi; Vihan Shah (ITCS, 2022)

Single-pass Streaming Lower Bounds for Multi-armed Bandits Exploration with Instance-sensitive Sample Complexity. - Sepehr Assadi; Chen Wang 027 (NeurIPS, 2022)

Spine: Scaling up Programming-by-Negative-Example for String Filtering and Transformation. - Chaoji Zuo; Sepehr Assadi; Dong Deng 001 (SIGMOD Conference, 2022)

A Two-Pass (Conditional) Lower Bound for Semi-Streaming Maximum Matching. - Sepehr Assadi (SODA, 2022)

Semi-Streaming Bipartite Matching in Fewer Passes and Optimal Space. - Sepehr Assadi; Arun Jambulapati; Yujia Jin; Aaron Sidford; Kevin Tian (SODA, 2022)

Deterministic graph coloring in the streaming model. - Sepehr Assadi; Andrew Chen; Glenn Sun (STOC, 2022)

Brooks' theorem in graph streams: a single-pass semi-streaming algorithm for ∆-coloring. - Sepehr Assadi; Pankaj Kumar; Parth Mittal (STOC, 2022)

Graph Coloring, Palette Sparsification, and Beyond (Invited Talk). - Sepehr Assadi (DISC, 2022)

Fine-Grained Buy-Many Mechanisms Are Not Much Better Than Bundling. - Sepehr Assadi; Ariel Schvartzman (CoRR, 2022)

Rounds vs Communication Tradeoffs for Maximal Independent Sets. - Sepehr Assadi; Gillat Kol; Zhijun Zhang 007 (Electron. Colloquium Comput. Complex., 2022)

Introduction to the Special Issue on ACM-SIAM Symposium on Discrete Algorithms (SODA) 2020. - Gautam Kamath 001; Sepehr Assadi; Anne Driemel; Janardhan Kulkarni (ACM Trans. Algorithms, 2022)

Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions. - Sepehr Assadi; Hrishikesh Khandeparkar; Raghuvansh R. Saxena; S. Matthew Weinberg (SIAM J. Comput., 2022)

Evaluating Stability in Massive Social Networks: Efficient Streaming Algorithms for Structural Balance. - Vikrant Ashvinkumar; Sepehr Assadi; Chengyuan Deng; Jie Gao 001; Chen Wang 027 (APPROX/RANDOM, 2023)

On Constructing Spanners from Random Gaussian Projections. - Sepehr Assadi; Michael Kapralov; Huacheng Yu (APPROX/RANDOM, 2023)

Hidden Permutations to the Rescue: Multi-Pass Streaming Lower Bounds for Approximate Matchings. - Sepehr Assadi; Janani Sundaresan (FOCS, 2023)

Generalizing Greenwald-Khanna Streaming Quantile Summaries for Weighted Inputs. - Sepehr Assadi; Nirmit Joshi; Milind Prabhu; Vihan Shah (ICDT, 2023)

All-Norm Load Balancing in Graph Streams via the Multiplicative Weights Update Method. - Sepehr Assadi; Aaron Bernstein; Zachary Langley (ITCS, 2023)

Streaming Algorithms and Lower Bounds for Estimating Correlation Clustering Cost. - Sepehr Assadi; Vihan Shah; Chen Wang 027 (NeurIPS, 2023)

Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms. - Sepehr Assadi; Amit Chakrabarti; Prantar Ghosh; Manuel Stoeckl (PODS, 2023)

Fine-Grained Buy-Many Mechanisms Are Not Much Better Than Bundling. - Sepehr Assadi; Vikram Kher; George Li 002; Ariel Schvartzman (EC, 2023)

Tight Bounds for Monotone Minimal Perfect Hashing. - Sepehr Assadi; Martin Farach-Colton; William Kuszmaul (SODA, 2023)

Tight Bounds for Vertex Connectivity in Dynamic Streams. - Sepehr Assadi; Vihan Shah (SOSA, 2023)

On Regularity Lemma and Barriers in Streaming and Dynamic Matching. - Sepehr Assadi; Soheil Behnezhad; Sanjeev Khanna; Huan Li 002 (STOC, 2023)

(Noisy) Gap Cycle Counting Strikes Back: Random Order Streaming Lower Bounds for Connected Components and Beyond. - Sepehr Assadi; Janani Sundaresan (STOC, 2023)

The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Bandits. - Sepehr Assadi; Chen Wang 027 (CoRR, 2023)

Hidden Permutations to the Rescue: Multi-Pass Semi-Streaming Lower Bounds for Approximate Matchings. - Sepehr Assadi; Janani Sundaresan (CoRR, 2023)

Optimal Multi-Pass Lower Bounds for MST in Dynamic Streams. - Sepehr Assadi; Gillat Kol; Zhijun Zhang 007 (Electron. Colloquium Comput. Complex., 2023)

Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for Δ-Coloring. - Sepehr Assadi; Pankaj Kumar; Parth Mittal (TheoretiCS, 2023)

Recent Advances in Multi-Pass Graph Streaming Lower Bounds. - Sepehr Assadi (SIGACT News, 2023)

Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy. - Sepehr Assadi; Prantar Ghosh; Bruno Loff; Parth Mittal; Sagnik Mukhopadhyay (CCC, 2024)

The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Bandits. - Sepehr Assadi; Chen Wang (COLT, 2024)

A Simple (1 - ε)-Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching. - Sepehr Assadi (SOSA, 2024)

O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set. - Sepehr Assadi; Christian Konrad 001; Kheeran K. Naidu; Janani Sundaresan (STOC, 2024)

Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemerédi Graphs. - Sepehr Assadi; Sanjeev Khanna (CoRR, 2024)

Faster Vizing and Near-Vizing Edge Coloring Algorithms. - Sepehr Assadi (SODA, 2025)

Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams. - Sepehr Assadi; Soheil Behnezhad; Christian Konrad 001; Kheeran K. Naidu; Janani Sundaresan (SODA, 2025)

Streaming and Communication Complexity of Load-Balancing via Matching Contractors. - Sepehr Assadi; Aaron Bernstein; Zachary Langley; Lap Chi Lau; Robert Wang 004 (SODA, 2025)

Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemerédi Graphs. - Sepehr Assadi; Sanjeev Khanna; Peter Kiss (SODA, 2025)

Simple Sublinear Algorithms for (Δ + 1) Vertex Coloring via Asymmetric Palette Sparsification. - Sepehr Assadi; Helia Yazdanyar (SOSA, 2025)

Vizing's Theorem in Near-Linear Time. - Sepehr Assadi; Soheil Behnezhad; Sayan Bhattacharya; Martín Costa; Shay Solomon; Tianyi Zhang 008 (STOC, 2025)

Covering Approximate Shortest Paths with DAGs. - Sepehr Assadi; Gary Hoppenworth; Nicole Wein (STOC, 2025)

Correlation Clustering and (De)Sparsification: Graph Sketches Can Match Classical Algorithms. - Sepehr Assadi; Sanjeev Khanna; Aaron Putterman (STOC, 2025)

A Simple $(1-ε)$-Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching. - Sepehr Assadi (TheoretiCS, 2025)

Distributed Triangle Detection is Hard in Few Rounds. - Sepehr Assadi; Janani Sundaresan (CoRR, 2025)

An Improved Fully Dynamic Algorithm for Counting 4-Cycles in General Graphs Using Fast Matrix Multiplication. - Sepehr Assadi; Vihan Shah (Proc. ACM Manag. Data, 2025)

Better Bounds for Semi-Streaming Single-Source Shortest Paths. - Sepehr Assadi; Gary Hoppenworth; Janani Sundaresan (CoRR, 2025)