Sepehr Assadi - RankMe

186 papers A* 58A 15B 3Journal 97Unranked 12

Year	Rank	Type	Title / Venue / Authors
2026	—	`ed.`	2026 Symposium on Simplicity in Algorithms, SOSA 2026, Vancouver, BC, Canada, January 12-14, 2026 SOSA Sepehr Assadi, Eva Rotenberg
2026	A*	`conf`	Better Bounds for Semi-Streaming Single-Source Shortest Paths. SODA Sepehr Assadi, Gary Hoppenworth, Janani Sundaresan
2026	A*	`conf`	Coloring Graphs with Few Colors in the Streaming Model. SODA Sepehr Assadi, Janani Sundaresan, Helia Yazdanyar
2026	J	`jnl`	Simple Sublinear Algorithms for (Δ+1) Vertex Coloring via Asymmetric Palette Sparsification. TheoretiCS Sepehr Assadi, Helia Yazdanyar
2026	A*	`conf`	Vizing's Theorem in Deterministic Almost-Linear Time. SODA Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang
2025	J	`jnl`	A Simple (1-ε)-Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching. TheoretiCS Sepehr Assadi
2025	J	`jnl`	An Improved Fully Dynamic Algorithm for Counting 4-Cycles in General Graphs Using Fast Matrix Multiplication. Proc. ACM Manag. Data Sepehr Assadi, Vihan Shah
2025	J	`jnl`	An Improved Fully Dynamic Algorithm for Counting 4-Cycles in General Graphs using Fast Matrix Multiplication. CoRR Sepehr Assadi, Vihan Shah
2025	J	`jnl`	Better Bounds for Semi-Streaming Single-Source Shortest Paths. CoRR Sepehr Assadi, Gary Hoppenworth, Janani Sundaresan
2025	J	`jnl`	Coloring Graphs with Few Colors in the Streaming Model. CoRR Sepehr Assadi, Janani Sundaresan, Helia Yazdanyar
2025	A*	`conf`	Correlation Clustering and (De)Sparsification: Graph Sketches Can Match Classical Algorithms. STOC Sepehr Assadi, Sanjeev Khanna, Aaron Putterman
2025	J	`jnl`	Correlation Clustering and (De)Sparsification: Graph Sketches Can Match Classical Algorithms. CoRR Sepehr Assadi, Sanjeev Khanna, Aaron Putterman
2025	A*	`conf`	Covering Approximate Shortest Paths with DAGs. STOC Sepehr Assadi, Gary Hoppenworth, Nicole Wein
2025	J	`jnl`	Covering Approximate Shortest Paths with DAGs. CoRR Sepehr Assadi, Gary Hoppenworth, Nicole Wein
2025	A*	`conf`	Distributed Triangle Detection is Hard in Few Rounds. FOCS Sepehr Assadi, Janani Sundaresan
2025	J	`jnl`	Distributed Triangle Detection is Hard in Few Rounds. CoRR Sepehr Assadi, Janani Sundaresan
2025	A*	`conf`	Faster Vizing and Near-Vizing Edge Coloring Algorithms. SODA Sepehr Assadi
2025	A*	`conf`	Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemerédi Graphs. SODA Sepehr Assadi, Sanjeev Khanna, Peter Kiss
2025	J	`jnl`	Improved Truthful Mechanisms for Combinatorial Auctions with Submodular Bidders. SIAM J. Comput. Sepehr Assadi, Sahil Singla
2025	J	`jnl`	Rounds vs. Communication Tradeoffs for Maximal Independent Sets. SIAM J. Comput. Sepehr Assadi, Gillat Kol, Zhijun Zhang
2025	A*	`conf`	Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams. SODA Sepehr Assadi, Soheil Behnezhad, Christian Konrad, Kheeran K. Naidu, Janani Sundaresan
2025	—	`conf`	Simple Sublinear Algorithms for (Δ + 1) Vertex Coloring via Asymmetric Palette Sparsification. SOSA Sepehr Assadi, Helia Yazdanyar
2025	J	`jnl`	Simple Sublinear Algorithms for (Δ+1) Vertex Coloring via Asymmetric Palette Sparsification. CoRR Sepehr Assadi, Helia Yazdanyar
2025	A*	`conf`	Streaming and Communication Complexity of Load-Balancing via Matching Contractors. SODA Sepehr Assadi, Aaron Bernstein, Zachary Langley, Lap Chi Lau, Robert Wang
2025	J	`jnl`	Tight Bounds for Monotone Minimal Perfect Hashing. ACM Trans. Algorithms Sepehr Assadi, Martín Farach-Colton, William Kuszmaul
2025	J	`jnl`	Vizing's Theorem in Deterministic Almost-Linear Time. CoRR Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang
2025	A*	`conf`	Vizing's Theorem in Near-Linear Time. STOC Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang
2024	—	`conf`	A Simple (1 - SOSA Sepehr Assadi
2024	J	`jnl`	Faster Vizing and Near-Vizing Edge Coloring Algorithms. CoRR Sepehr Assadi
2024	J	`jnl`	Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemerédi Graphs. CoRR Sepehr Assadi, Sanjeev Khanna
2024	A*	`conf`	O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set. STOC Sepehr Assadi, Christian Konrad, Kheeran K. Naidu, Janani Sundaresan
2024	A*	`conf`	Optimal Multi-pass Lower Bounds for MST in Dynamic Streams. STOC Sepehr Assadi, Gillat Kol, Zhijun Zhang
2024	A	`conf`	Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy. CCC Sepehr Assadi, Prantar Ghosh, Bruno Loff, Parth Mittal, Sagnik Mukhopadhyay
2024	J	`jnl`	Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy. CoRR Sepehr Assadi, Prantar Ghosh, Bruno Loff, Parth Mittal, Sagnik Mukhopadhyay
2024	J	`jnl`	Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams. CoRR Sepehr Assadi, Soheil Behnezhad, Christian Konrad, Kheeran K. Naidu, Janani Sundaresan
2024	J	`jnl`	Streaming and Communication Complexity of Load-Balancing via Matching Contractors. CoRR Sepehr Assadi, Aaron Bernstein, Zachary Langley, Lap Chi Lau, Robert Wang
2024	A*	`conf`	The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Bandits. COLT Sepehr Assadi, Chen Wang
2024	J	`jnl`	Vizing's Theorem in Near-Linear Time. CoRR Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang
2023	A*	`conf`	(Noisy) Gap Cycle Counting Strikes Back: Random Order Streaming Lower Bounds for Connected Components and Beyond. STOC Sepehr Assadi, Janani Sundaresan
2023	J	`jnl`	(Noisy) Gap Cycle Counting Strikes Back: Random Order Streaming Lower Bounds for Connected Components and Beyond. CoRR Sepehr Assadi, Janani Sundaresan
2023	J	`jnl`	A Simple (1-ε)-Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching. CoRR Sepehr Assadi
2023	A	`conf`	All-Norm Load Balancing in Graph Streams via the Multiplicative Weights Update Method. ITCS Sepehr Assadi, Aaron Bernstein, Zachary Langley
2023	J	`jnl`	All-Norm Load Balancing in Graph Streams via the Multiplicative Weights Update Method. CoRR Sepehr Assadi, Aaron Bernstein, Zachary Langley
2023	J	`jnl`	Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for Δ-Coloring. TheoretiCS Sepehr Assadi, Pankaj Kumar, Parth Mittal
2023	A*	`conf`	Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms. PODS Sepehr Assadi, Amit Chakrabarti, Prantar Ghosh, Manuel Stoeckl
2023	A	`conf`	Evaluating Stability in Massive Social Networks: Efficient Streaming Algorithms for Structural Balance. APPROX/RANDOM Vikrant Ashvinkumar, Sepehr Assadi, Chengyuan Deng, Jie Gao, Chen Wang
2023	J	`jnl`	Evaluating Stability in Massive Social Networks: Efficient Streaming Algorithms for Structural Balance. CoRR Vikrant Ashvinkumar, Sepehr Assadi, Chengyuan Deng, Jie Gao, Chen Wang
2023	A*	`conf`	Fine-Grained Buy-Many Mechanisms Are Not Much Better Than Bundling. EC Sepehr Assadi, Vikram Kher, George Li, Ariel Schvartzman
2023	A	`conf`	Generalizing Greenwald-Khanna Streaming Quantile Summaries for Weighted Inputs. ICDT Sepehr Assadi, Nirmit Joshi, Milind Prabhu, Vihan Shah
2023	J	`jnl`	Generalizing Greenwald-Khanna Streaming Quantile Summaries for Weighted Inputs. CoRR Sepehr Assadi, Nirmit Joshi, Milind Prabhu, Vihan Shah
2023	J	`jnl`	Hidden Permutations to the Rescue: Multi-Pass Semi-Streaming Lower Bounds for Approximate Matchings. CoRR Sepehr Assadi, Janani Sundaresan
2023	A*	`conf`	Hidden Permutations to the Rescue: Multi-Pass Streaming Lower Bounds for Approximate Matchings. FOCS Sepehr Assadi, Janani Sundaresan
2023	J	`jnl`	O(log log n) Passes is Optimal for Semi-Streaming Maximal Independent Set. CoRR Sepehr Assadi, Christian Konrad, Kheeran K. Naidu, Janani Sundaresan
2023	A	`conf`	On Constructing Spanners from Random Gaussian Projections. APPROX/RANDOM Sepehr Assadi, Michael Kapralov, Huacheng Yu
2023	A*	`conf`	On Regularity Lemma and Barriers in Streaming and Dynamic Matching. STOC Sepehr Assadi, Soheil Behnezhad, Sanjeev Khanna, Huan Li
2023	J	`jnl`	Optimal Multi-Pass Lower Bounds for MST in Dynamic Streams. CoRR Sepehr Assadi, Gillat Kol, Zhijun Zhang
2023	J	`jnl`	Optimal Multi-Pass Lower Bounds for MST in Dynamic Streams. Electron. Colloquium Comput. Complex. Sepehr Assadi, Gillat Kol, Zhijun Zhang
2023	J	`jnl`	Recent Advances in Multi-Pass Graph Streaming Lower Bounds. SIGACT News Sepehr Assadi
2023	A*	`conf`	Streaming Algorithms and Lower Bounds for Estimating Correlation Clustering Cost. NeurIPS Sepehr Assadi, Vihan Shah, Chen Wang
2023	J	`jnl`	The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Bandits. CoRR Sepehr Assadi, Chen Wang
2023	A*	`conf`	Tight Bounds for Monotone Minimal Perfect Hashing. SODA Sepehr Assadi, Martin Farach-Colton, William Kuszmaul
2023	—	`conf`	Tight Bounds for Vertex Connectivity in Dynamic Streams. SOSA Sepehr Assadi, Vihan Shah
2022	A*	`conf`	A Two-Pass (Conditional) Lower Bound for Semi-Streaming Maximum Matching. SODA Sepehr Assadi
2022	A	`conf`	An Asymptotically Optimal Algorithm for Maximum Matching in Dynamic Streams. ITCS Sepehr Assadi, Vihan Shah
2022	J	`jnl`	An Asymptotically Optimal Algorithm for Maximum Matching in Dynamic Streams. CoRR Sepehr Assadi, Vihan Shah
2022	A	`conf`	Asymptotically Optimal Bounds for Estimating H-Index in Sublinear Time with Applications to Subgraph Counting. APPROX/RANDOM Sepehr Assadi, Hoai-An Nguyen
2022	J	`jnl`	Asymptotically Optimal Bounds for Estimating H-Index in Sublinear Time with Applications to Subgraph Counting. CoRR Sepehr Assadi, Hoai-An Nguyen
2022	J	`jnl`	Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for Δ-Coloring. CoRR Sepehr Assadi, Pankaj Kumar, Parth Mittal
2022	A*	`conf`	Brooks' theorem in graph streams: a single-pass semi-streaming algorithm for ∆-coloring. STOC Sepehr Assadi, Pankaj Kumar, Parth Mittal
2022	J	`jnl`	Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms. CoRR Sepehr Assadi, Amit Chakrabarti, Prantar Ghosh, Manuel Stoeckl
2022	A*	`conf`	Decremental Matching in General Graphs. ICALP Sepehr Assadi, Aaron Bernstein, Aditi Dudeja
2022	J	`jnl`	Decremental Matching in General Graphs. CoRR Sepehr Assadi, Aaron Bernstein, Aditi Dudeja
2022	A*	`conf`	Deterministic graph coloring in the streaming model. STOC Sepehr Assadi, Andrew Chen, Glenn Sun
2022	J	`jnl`	Fine-Grained Buy-Many Mechanisms Are Not Much Better Than Bundling. CoRR Sepehr Assadi, Ariel Schvartzman
2022	A	`conf`	Graph Coloring, Palette Sparsification, and Beyond (Invited Talk). DISC Sepehr Assadi
2022	A*	`conf`	Hierarchical Clustering in Graph Streams: Single-Pass Algorithms and Space Lower Bounds. COLT Sepehr Assadi, Vaggos Chatziafratis, Jakub Lacki, Vahab Mirrokni, Chen Wang
2022	J	`jnl`	Hierarchical Clustering in Graph Streams: Single-Pass Algorithms and Space Lower Bounds. CoRR Sepehr Assadi, Vaggos Chatziafratis, Jakub Lacki, Vahab S. Mirrokni, Chen Wang
2022	J	`jnl`	Introduction to the Special Issue on ACM-SIAM Symposium on Discrete Algorithms (SODA) 2020. ACM Trans. Algorithms Gautam Kamath, Sepehr Assadi, Anne Driemel, Janardhan Kulkarni
2022	J	`jnl`	On Constructing Spanners from Random Gaussian Projections. CoRR Sepehr Assadi, Michael Kapralov, Huacheng Yu
2022	J	`jnl`	On Regularity Lemma and Barriers in Streaming and Dynamic Matching. CoRR Sepehr Assadi, Soheil Behnezhad, Sanjeev Khanna, Huan Li
2022	A*	`conf`	Rounds vs Communication Tradeoffs for Maximal Independent Sets. FOCS Sepehr Assadi, Gillat Kol, Zhijun Zhang
2022	J	`jnl`	Rounds vs Communication Tradeoffs for Maximal Independent Sets. CoRR Sepehr Assadi, Gillat Kol, Zhijun Zhang
2022	J	`jnl`	Rounds vs Communication Tradeoffs for Maximal Independent Sets. Electron. Colloquium Comput. Complex. Sepehr Assadi, Gillat Kol, Zhijun Zhang
2022	A*	`conf`	Semi-Streaming Bipartite Matching in Fewer Passes and Optimal Space. SODA Sepehr Assadi, Arun Jambulapati, Yujia Jin, Aaron Sidford, Kevin Tian
2022	J	`jnl`	Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions. SIAM J. Comput. Sepehr Assadi, Hrishikesh Khandeparkar, Raghuvansh R. Saxena, S. Matthew Weinberg
2022	A*	`conf`	Single-pass Streaming Lower Bounds for Multi-armed Bandits Exploration with Instance-sensitive Sample Complexity. NeurIPS Sepehr Assadi, Chen Wang
2022	—	`conf`	Spine: Scaling up Programming-by-Negative-Example for String Filtering and Transformation. SIGMOD Conference Chaoji Zuo, Sepehr Assadi, Dong Deng
2022	A	`conf`	Sublinear Time and Space Algorithms for Correlation Clustering via Sparse-Dense Decompositions. ITCS Sepehr Assadi, Chen Wang
2022	J	`jnl`	Tight Bounds for Monotone Minimal Perfect Hashing. CoRR Sepehr Assadi, Martin Farach-Colton, William Kuszmaul
2022	J	`jnl`	Tight Bounds for Vertex Connectivity in Dynamic Streams. CoRR Sepehr Assadi, Vihan Shah
2021	—	`conf`	A Simple Semi-Streaming Algorithm for Global Minimum Cuts. SOSA Sepehr Assadi, Aditi Dudeja
2021	J	`jnl`	A Two-Pass Lower Bound for Semi-Streaming Maximum Matching. CoRR Sepehr Assadi
2021	—	`conf`	An Auction Algorithm for Bipartite Matching in Streaming and Massively Parallel Computation Models. SOSA Sepehr Assadi, S. Cliff Liu, Robert E. Tarjan
2021	A*	`conf`	Beating Two-Thirds For Random-Order Streaming Matching. ICALP Sepehr Assadi, Soheil Behnezhad
2021	J	`jnl`	Beating Two-Thirds For Random-Order Streaming Matching. CoRR Sepehr Assadi, Soheil Behnezhad
2021	J	`jnl`	Deterministic Graph Coloring in the Streaming Model. CoRR Sepehr Assadi, Andrew Chen, Glenn Sun
2021	A	`conf`	Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach. ESA Sepehr Assadi, Shay Solomon
2021	J	`jnl`	Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach. CoRR Sepehr Assadi, Shay Solomon
2021	A	`conf`	Graph Connectivity and Single Element Recovery via Linear and OR Queries. ESA Sepehr Assadi, Deeparnab Chakrabarty, Sanjeev Khanna
2021	J	`jnl`	Graph Streaming Lower Bounds for Parameter Estimation and Property Testing via a Streaming XOR Lemma. CoRR Sepehr Assadi, Vishvajeet N
2021	A*	`conf`	Graph streaming lower bounds for parameter estimation and property testing via a streaming XOR lemma. STOC Sepehr Assadi, Vishvajeet N
2021	A*	`conf`	Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier. SODA Sepehr Assadi, Thomas Kesselheim, Sahil Singla
2021	—	`conf`	On the Robust Communication Complexity of Bipartite Matching. APPROX-RANDOM Sepehr Assadi, Soheil Behnezhad
2021	A	`conf`	Ruling Sets in Random Order and Adversarial Streams. DISC Sepehr Assadi, Aditi Dudeja
2021	J	`jnl`	Sublinear Time and Space Algorithms for Correlation Clustering via Sparse-Dense Decompositions. CoRR Sepehr Assadi, Chen Wang
2021	J	`jnl`	Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem. SIAM J. Comput. Sepehr Assadi, Sanjeev Khanna, Yang Li
2020	J	`jnl`	Combinatorial Auctions Do Need Modest Interaction. ACM Trans. Economics and Comput. Sepehr Assadi
2020	J	`jnl`	Exploration with Limited Memory: Streaming Algorithms for Coin Tossing, Noisy Comparisons, and Multi-Armed Bandits. CoRR Sepehr Assadi, Chen Wang
2020	A*	`conf`	Exploration with limited memory: streaming algorithms for coin tossing, noisy comparisons, and multi-armed bandits. STOC Sepehr Assadi, Chen Wang
2020	J	`jnl`	Graph Connectivity and Single Element Recovery via Linear and OR Queries. CoRR Sepehr Assadi, Deeparnab Chakrabarty, Sanjeev Khanna
2020	A	`conf`	Improved Bounds for Distributed Load Balancing. DISC Sepehr Assadi, Aaron Bernstein, Zachary Langley
2020	J	`jnl`	Improved Bounds for Distributed Load Balancing. CoRR Sepehr Assadi, Aaron Bernstein, Zachary Langley
2020	J	`jnl`	Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier. CoRR Sepehr Assadi, Thomas Kesselheim, Sahil Singla
2020	J	`jnl`	Improved truthful mechanisms for combinatorial auctions with submodular bidders. SIGecom Exch. Sepehr Assadi, Sahil Singla
2020	A*	`conf`	Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets. PODC Sepehr Assadi, Gillat Kol, Rotem Oshman
2020	A*	`conf`	Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems. FOCS Sepehr Assadi, Gillat Kol, Raghuvansh R. Saxena, Huacheng Yu
2020	J	`jnl`	Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems. CoRR Sepehr Assadi, Gillat Kol, Raghuvansh R. Saxena, Huacheng Yu
2020	A*	`conf`	Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms. FOCS Sepehr Assadi, Ran Raz
2020	J	`jnl`	Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms. CoRR Sepehr Assadi, Ran Raz
2020	—	`conf`	Palette Sparsification Beyond (Δ+1) Vertex Coloring. APPROX-RANDOM Noga Alon, Sepehr Assadi
2020	J	`jnl`	Palette Sparsification Beyond (Δ+1) Vertex Coloring. CoRR Noga Alon, Sepehr Assadi
2020	J	`jnl`	Separating the Communication Complexity of Truthful and Non-Truthful Combinatorial Auctions. CoRR Sepehr Assadi, Hrishikesh Khandeparkar, Raghuvansh R. Saxena, S. Matthew Weinberg
2020	A*	`conf`	Separating the communication complexity of truthful and non-truthful combinatorial auctions. STOC Sepehr Assadi, Hrishikesh Khandeparkar, Raghuvansh R. Saxena, S. Matthew Weinberg
2020	J	`jnl`	When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear-Time. CoRR Sepehr Assadi, Shay Solomon
2019	A	`conf`	A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling. ITCS Sepehr Assadi, Michael Kapralov, Sanjeev Khanna
2019	A*	`conf`	Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs. SODA Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, Vahab S. Mirrokni, Cliff Stein
2019	A*	`conf`	Distributed Weighted Matching via Randomized Composable Coresets. ICML Sepehr Assadi, MohammadHossein Bateni, Vahab S. Mirrokni
2019	J	`jnl`	Distributed Weighted Matching via Randomized Composable Coresets. CoRR Sepehr Assadi, MohammadHossein Bateni, Vahab S. Mirrokni
2019	A*	`conf`	Distributed and Streaming Linear Programming in Low Dimensions. PODS Sepehr Assadi, Nikolai Karpov, Qin Zhang
2019	J	`jnl`	Distributed and Streaming Linear Programming in Low Dimensions. CoRR Sepehr Assadi, Nikolai Karpov, Qin Zhang
2019	A*	`conf`	Fully Dynamic Maximal Independent Set with Sublinear in n Update Time. SODA Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon
2019	A*	`conf`	Improved Truthful Mechanisms for Combinatorial Auctions with Submodular Bidders. FOCS Sepehr Assadi, Sahil Singla
2019	J	`jnl`	Improved Truthful Mechanisms for Combinatorial Auctions with Submodular Bidders. CoRR Sepehr Assadi, Sahil Singla
2019	A*	`conf`	Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs. PODC Sepehr Assadi, Xiaorui Sun, Omri Weinstein
2019	J	`jnl`	Polynomial Pass Lower Bounds for Graph Streaming Algorithms. CoRR Sepehr Assadi, Yu Chen, Sanjeev Khanna
2019	A*	`conf`	Polynomial pass lower bounds for graph streaming algorithms. STOC Sepehr Assadi, Yu Chen, Sanjeev Khanna
2019	A*	`conf`	Secretary Ranking with Minimal Inversions. NeurIPS Sepehr Assadi, Eric Balkanski, Renato Paes Leme
2019	A*	`conf`	Stochastic Submodular Cover with Limited Adaptivity. SODA Arpit Agarwal, Sepehr Assadi, Sanjeev Khanna
2019	A*	`conf`	Sublinear Algorithms for (Δ + 1) Vertex Coloring. SODA Sepehr Assadi, Yu Chen, Sanjeev Khanna
2019	J	`jnl`	The Stochastic Matching Problem with (Very) Few Queries. ACM Trans. Economics and Comput. Sepehr Assadi, Sanjeev Khanna, Yang Li
2019	—	`conf`	Towards a Unified Theory of Sparsification for Matching Problems. SOSA Sepehr Assadi, Aaron Bernstein
2019	A*	`conf`	When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time. ICALP Sepehr Assadi, Shay Solomon
2018	J	`jnl`	A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling. CoRR Sepehr Assadi, Michael Kapralov, Sanjeev Khanna
2018	J	`jnl`	Fully Dynamic Maximal Independent Set with Sublinear Update Time. CoRR Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon
2018	J	`jnl`	Fully Dynamic Maximal Independent Set with Sublinear in n Update Time. CoRR Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon
2018	A*	`conf`	Fully dynamic maximal independent set with sublinear update time. STOC Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon
2018	J	`jnl`	Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs. CoRR Sepehr Assadi, Xiaorui Sun, Omri Weinstein
2018	J	`jnl`	Secretary Ranking with Minimal Inversions. CoRR Sepehr Assadi, Eric Balkanski, Renato Paes Leme
2018	J	`jnl`	Stochastic Submodular Cover with Limited Adaptivity. CoRR Arpit Agarwal, Sepehr Assadi, Sanjeev Khanna
2018	J	`jnl`	Sublinear Algorithms for (Δ+ 1) Vertex Coloring. CoRR Sepehr Assadi, Yu Chen, Sanjeev Khanna
2018	A*	`conf`	Tight Bounds on the Round Complexity of the Distributed Maximum Coverage Problem. SODA Sepehr Assadi, Sanjeev Khanna
2018	J	`jnl`	Tight Bounds on the Round Complexity of the Distributed Maximum Coverage Problem. CoRR Sepehr Assadi, Sanjeev Khanna
2018	J	`jnl`	Towards a Unified Theory of Sparsification for Matching Problems. CoRR Sepehr Assadi, Aaron Bernstein
2017	A*	`conf`	Combinatorial Auctions Do Need Modest Interaction. EC Sepehr Assadi
2017	J	`jnl`	Combinatorial Auctions Do Need Modest Interaction. CoRR Sepehr Assadi
2017	J	`jnl`	Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs. CoRR Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, Vahab S. Mirrokni, Cliff Stein
2017	J	`jnl`	Fast Convergence in the Double Oral Auction. ACM Trans. Economics and Comput. Sepehr Assadi, Sanjeev Khanna, Yang Li, Rakesh Vohra
2017	A*	`conf`	Learning with Limited Rounds of Adaptivity: Coin Tossing, Multi-Armed Bandits, and Ranking from Pairwise Comparisons. COLT Arpit Agarwal, Shivani Agarwal, Sepehr Assadi, Sanjeev Khanna
2017	A*	`conf`	On Estimating Maximum Matching Size in Graph Streams. SODA Sepehr Assadi, Sanjeev Khanna, Yang Li
2017	J	`jnl`	On Estimating Maximum Matching Size in Graph Streams. CoRR Sepehr Assadi, Sanjeev Khanna, Yang Li
2017	J	`jnl`	On the rectangle escape problem. Theor. Comput. Sci. AmirMahdi Ahmadinejad, Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Sadra Yazdanbod, Hamid Zarrabi-Zadeh
2017	B	`conf`	Randomized Composable Coresets for Matching and Vertex Cover. SPAA Sepehr Assadi, Sanjeev Khanna
2017	J	`jnl`	Randomized Composable Coresets for Matching and Vertex Cover. CoRR Sepehr Assadi, Sanjeev Khanna
2017	J	`jnl`	SPAA 2017 Review. SIGACT News Sepehr Assadi
2017	J	`jnl`	Simple Round Compression for Parallel Vertex Cover. CoRR Sepehr Assadi
2017	A*	`conf`	The Stochastic Matching Problem: Beating Half with a Non-Adaptive Algorithm. EC Sepehr Assadi, Sanjeev Khanna, Yang Li
2017	J	`jnl`	The Stochastic Matching Problem: Beating Half with a Non-Adaptive Algorithm. CoRR Sepehr Assadi, Sanjeev Khanna, Yang Li
2017	A*	`conf`	Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem. PODS Sepehr Assadi
2017	J	`jnl`	Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem. CoRR Sepehr Assadi
2016	J	`jnl`	A Compile-Time Optimization Method for WCET Reduction in Real-Time Embedded Systems through Block Formation. ACM Trans. Archit. Code Optim. Morteza Mohajjel Kafshdooz, Mohammadkazem Taram, Sepehr Assadi, Alireza Ejlali
2016	A	`conf`	Algorithms for Provisioning Queries and Analytics. ICDT Sepehr Assadi, Sanjeev Khanna, Yang Li, Val Tannen
2016	A*	`conf`	Maximum Matchings in Dynamic Graph Streams and the Simultaneous Communication Model. SODA Sepehr Assadi, Sanjeev Khanna, Yang Li, Grigory Yaroslavtsev
2016	A*	`conf`	The Stochastic Matching Problem with (Very) Few Queries. EC Sepehr Assadi, Sanjeev Khanna, Yang Li
2016	J	`jnl`	Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem. CoRR Sepehr Assadi, Sanjeev Khanna, Yang Li
2016	A*	`conf`	Tight bounds for single-pass streaming complexity of the set cover problem. STOC Sepehr Assadi, Sanjeev Khanna, Yang Li
2015	J	`jnl`	Algorithms for Provisioning Queries and Analytics. CoRR Sepehr Assadi, Sanjeev Khanna, Yang Li, Val Tannen
2015	—	`conf`	Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches. FSTTCS Sepehr Assadi, Sanjeev Khanna, Yang Li, Val Tannen
2015	J	`jnl`	Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches. CoRR Sepehr Assadi, Sanjeev Khanna, Yang Li, Val Tannen
2015	—	`conf`	Fast Convergence in the Double Oral Auction. WINE Sepehr Assadi, Sanjeev Khanna, Yang Li, Rakesh V. Vohra
2015	J	`jnl`	Fast Convergence in the Double Oral Auction. CoRR Sepehr Assadi, Sanjeev Khanna, Yang Li, Rakesh Vohra
2015	B	`conf`	Online Assignment of Heterogeneous Tasks in Crowdsourcing Markets. HCOMP Sepehr Assadi, Justin Hsu, Shahin Jabbari
2015	J	`jnl`	Online Assignment of Heterogeneous Tasks in Crowdsourcing Markets. CoRR Sepehr Assadi, Justin Hsu, Shahin Jabbari
2015	J	`jnl`	Tight Bounds for Linear Sketches of Approximate Matchings. CoRR Sepehr Assadi, Sanjeev Khanna, Yang Li, Grigory Yaroslavtsev
2014	J	`jnl`	The Minimum Vulnerability Problem. Algorithmica Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Ashkan Norouzi-Fard, Sadra Yazdanbod, Hamid Zarrabi-Zadeh
2013	—	`conf`	On the Rectangle Escape Problem. CCCG Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Sadra Yazdanbod, Hamid Zarrabi-Zadeh
2012	B	`conf`	The Minimum Vulnerability Problem. ISAAC Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Ashkan Norouzi-Fard, Sadra Yazdanbod, Hamid Zarrabi-Zadeh