| 2026 | ICALP | Fully Dynamic Algorithms for Coloring Triangle-Free Graphs. | Sepehr Assadi, Helia Yazdanyar |
| 2026 | SODA | Vizing's Theorem in Deterministic Almost-Linear Time. | Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya, Martn Costa, Shay Solomon, Tianyi Zhang |
| 2026 | SODA | Better Bounds for Semi-Streaming Single-Source Shortest Paths. | Sepehr Assadi, Gary Hoppenworth, Janani Sundaresan |
| 2026 | SODA | Coloring Graphs with Few Colors in the Streaming Model. | Sepehr Assadi, Janani Sundaresan, Helia Yazdanyar |
| 2026 | STOC | Semi-streaming Matching in a Single Pass: A New Framework for Lower Bounds via Blueprints. | Sepehr Assadi, Max Jiang, Mars Xiang |
| 2026 | STOC | Settling the Pass Complexity of Streaming Set Cover. | Sepehr Assadi, Janani Sundaresan |
| 2025 | FOCS | Distributed Triangle Detection is Hard in Few Rounds. | Sepehr Assadi, Janani Sundaresan |
| 2025 | SODA | Faster Vizing and Near-Vizing Edge Coloring Algorithms. | Sepehr Assadi |
| 2025 | SODA | Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams. | Sepehr Assadi, Soheil Behnezhad, Christian Konrad, Kheeran K. Naidu, Janani Sundaresan |
| 2025 | SODA | Streaming and Communication Complexity of Load-Balancing via Matching Contractors. | Sepehr Assadi, Aaron Bernstein, Zachary Langley, Lap Chi Lau, Robert Wang |
| 2025 | SODA | Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemerdi Graphs. | Sepehr Assadi, Sanjeev Khanna, Peter Kiss |
| 2025 | STOC | Vizing's Theorem in Near-Linear Time. | Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya, Martn Costa, Shay Solomon, Tianyi Zhang |
| 2025 | STOC | Covering Approximate Shortest Paths with DAGs. | Sepehr Assadi, Gary Hoppenworth, Nicole Wein |
| 2025 | STOC | Correlation Clustering and (De)Sparsification: Graph Sketches Can Match Classical Algorithms. | Sepehr Assadi, Sanjeev Khanna, Aaron Putterman |
| 2024 | COLT | The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Bandits. | Sepehr Assadi, Chen Wang |
| 2024 | STOC | O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set. | Sepehr Assadi, Christian Konrad, Kheeran K. Naidu, Janani Sundaresan |
| 2024 | STOC | Optimal Multi-pass Lower Bounds for MST in Dynamic Streams. | Sepehr Assadi, Gillat Kol, Zhijun Zhang |
| 2023 | FOCS | Hidden Permutations to the Rescue: Multi-Pass Streaming Lower Bounds for Approximate Matchings. | Sepehr Assadi, Janani Sundaresan |
| 2023 | ICDT | Generalizing Greenwald-Khanna Streaming Quantile Summaries for Weighted Inputs. | Sepehr Assadi, Nirmit Joshi, Milind Prabhu, Vihan Shah |
| 2023 | PODS | Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms. | Sepehr Assadi, Amit Chakrabarti, Prantar Ghosh, Manuel Stoeckl |
| 2023 | SODA | Tight Bounds for Monotone Minimal Perfect Hashing. | Sepehr Assadi, Martin Farach-Colton, William Kuszmaul |
| 2023 | STOC | On Regularity Lemma and Barriers in Streaming and Dynamic Matching. | Sepehr Assadi, Soheil Behnezhad, Sanjeev Khanna, Huan Li |
| 2023 | STOC | (Noisy) Gap Cycle Counting Strikes Back: Random Order Streaming Lower Bounds for Connected Components and Beyond. | Sepehr Assadi, Janani Sundaresan |
| 2022 | COLT | Hierarchical Clustering in Graph Streams: Single-Pass Algorithms and Space Lower Bounds. | Sepehr Assadi, Vaggos Chatziafratis, Jakub Lacki, Vahab Mirrokni, Chen Wang |
| 2022 | FOCS | Rounds vs Communication Tradeoffs for Maximal Independent Sets. | Sepehr Assadi, Gillat Kol, Zhijun Zhang |
| 2022 | ICALP | Decremental Matching in General Graphs. | Sepehr Assadi, Aaron Bernstein, Aditi Dudeja |
| 2022 | SIGMOD | Spine: Scaling up Programming-by-Negative-Example for String Filtering and Transformation. | Chaoji Zuo, Sepehr Assadi, Dong Deng |
| 2022 | SODA | A Two-Pass (Conditional) Lower Bound for Semi-Streaming Maximum Matching. | Sepehr Assadi |
| 2022 | SODA | Semi-Streaming Bipartite Matching in Fewer Passes and Optimal Space. | Sepehr Assadi, Arun Jambulapati, Yujia Jin, Aaron Sidford, Kevin Tian |
| 2022 | STOC | Deterministic graph coloring in the streaming model. | Sepehr Assadi, Andrew Chen, Glenn Sun |
| 2022 | STOC | Brooks' theorem in graph streams: a single-pass semi-streaming algorithm for ∆-coloring. | Sepehr Assadi, Pankaj Kumar, Parth Mittal |
| 2021 | ESA | Graph Connectivity and Single Element Recovery via Linear and OR Queries. | Sepehr Assadi, Deeparnab Chakrabarty, Sanjeev Khanna |
| 2021 | ESA | Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach. | Sepehr Assadi, Shay Solomon |
| 2021 | ICALP | Beating Two-Thirds For Random-Order Streaming Matching. | Sepehr Assadi, Soheil Behnezhad |
| 2021 | SODA | Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier. | Sepehr Assadi, Thomas Kesselheim, Sahil Singla |
| 2021 | STOC | Graph streaming lower bounds for parameter estimation and property testing via a streaming XOR lemma. | Sepehr Assadi, Vishvajeet N |
| 2020 | FOCS | 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 |
| 2020 | FOCS | Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms. | Sepehr Assadi, Ran Raz |
| 2020 | PODC | Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets. | Sepehr Assadi, Gillat Kol, Rotem Oshman |
| 2020 | STOC | Separating the communication complexity of truthful and non-truthful combinatorial auctions. | Sepehr Assadi, Hrishikesh Khandeparkar, Raghuvansh R. Saxena, S. Matthew Weinberg |
| 2020 | STOC | Exploration with limited memory: streaming algorithms for coin tossing, noisy comparisons, and multi-armed bandits. | Sepehr Assadi, Chen Wang |
| 2019 | FOCS | Improved Truthful Mechanisms for Combinatorial Auctions with Submodular Bidders. | Sepehr Assadi, Sahil Singla |
| 2019 | ICALP | When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time. | Sepehr Assadi, Shay Solomon |
| 2019 | ICML | Distributed Weighted Matching via Randomized Composable Coresets. | Sepehr Assadi, MohammadHossein Bateni, Vahab S. Mirrokni |
| 2019 | PODC | Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs. | Sepehr Assadi, Xiaorui Sun, Omri Weinstein |
| 2019 | PODS | Distributed and Streaming Linear Programming in Low Dimensions. | Sepehr Assadi, Nikolai Karpov, Qin Zhang |
| 2019 | SODA | Stochastic Submodular Cover with Limited Adaptivity. | Arpit Agarwal, Sepehr Assadi, Sanjeev Khanna |
| 2019 | SODA | Towards a Unified Theory of Sparsification for Matching Problems. | Sepehr Assadi, Aaron Bernstein |
| 2019 | SODA | Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs. | Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, Vahab S. Mirrokni, Cliff Stein |
| 2019 | SODA | Sublinear Algorithms for (Δ + 1) Vertex Coloring. | Sepehr Assadi, Yu Chen, Sanjeev Khanna |
| 2019 | SODA | Fully Dynamic Maximal Independent Set with Sublinear in n Update Time. | Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon |
| 2019 | STOC | Polynomial pass lower bounds for graph streaming algorithms. | Sepehr Assadi, Yu Chen, Sanjeev Khanna |
| 2018 | SODA | Tight Bounds on the Round Complexity of the Distributed Maximum Coverage Problem. | Sepehr Assadi, Sanjeev Khanna |
| 2018 | STOC | Fully dynamic maximal independent set with sublinear update time. | Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon |
| 2017 | COLT | Learning with Limited Rounds of Adaptivity: Coin Tossing, Multi-Armed Bandits, and Ranking from Pairwise Comparisons. | Arpit Agarwal, Shivani Agarwal, Sepehr Assadi, Sanjeev Khanna |
| 2017 | PODS | Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem. | Sepehr Assadi |
| 2017 | SODA | On Estimating Maximum Matching Size in Graph Streams. | Sepehr Assadi, Sanjeev Khanna, Yang Li |
| 2017 | SPAA | Randomized Composable Coresets for Matching and Vertex Cover. | Sepehr Assadi, Sanjeev Khanna |
| 2016 | ICDT | Algorithms for Provisioning Queries and Analytics. | Sepehr Assadi, Sanjeev Khanna, Yang Li, Val Tannen |
| 2016 | SODA | Maximum Matchings in Dynamic Graph Streams and the Simultaneous Communication Model. | Sepehr Assadi, Sanjeev Khanna, Yang Li, Grigory Yaroslavtsev |
| 2016 | STOC | Tight bounds for single-pass streaming complexity of the set cover problem. | Sepehr Assadi, Sanjeev Khanna, Yang Li |
| 2015 | HCOMP | Online Assignment of Heterogeneous Tasks in Crowdsourcing Markets. | Sepehr Assadi, Justin Hsu, Shahin Jabbari |
| 2012 | ISAAC | The Minimum Vulnerability Problem. | Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Ashkan Norouzi-Fard, Sadra Yazdanbod, Hamid Zarrabi-Zadeh |