default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSepehr Assadi
Person information
SPARQL queries 
🛈 Please note that only 68% of the items listed on this page have a DOI stored with their dblp record. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[c81]Sepehr Assadi, Soheil Behnezhad, Christian Konrad, Kheeran K. Naidu, Janani Sundaresan:
Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams. SODA 2025: 864-904- [c80]Sepehr Assadi, Sanjeev Khanna, Peter Kiss:
Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemerédi Graphs. SODA 2025: 2971-2990 - [c79]Sepehr Assadi, Aaron Bernstein, Zachary Langley, Lap Chi Lau, Robert Wang:
Streaming and Communication Complexity of Load-Balancing via Matching Contractors. SODA 2025: 3423-3449 - [c78]Sepehr Assadi:
Faster Vizing and Near-Vizing Edge Coloring Algorithms. SODA 2025: 4861-4898 - [c77]Sepehr Assadi, Helia Yazdanyar:
Simple Sublinear Algorithms for (Δ + 1) Vertex Coloring via Asymmetric Palette Sparsification. SOSA 2025: 1-8 - [i71]Sepehr Assadi, Helia Yazdanyar:
Simple Sublinear Algorithms for (Δ+1) Vertex Coloring via Asymmetric Palette Sparsification. CoRR abs/2502.17629 (2025) - 2024
- [c76]Sepehr Assadi, Prantar Ghosh
, Bruno Loff, Parth Mittal, Sagnik Mukhopadhyay:
Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy. CCC 2024: 7:1-7:16 - [c75]Sepehr Assadi, Chen Wang:
The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Bandits. COLT 2024: 311-358 - [c74]Sepehr Assadi:
A Simple (1 - ε)-Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching. SOSA 2024: 337-354 - [c73]Sepehr Assadi, Gillat Kol, Zhijun Zhang:
Optimal Multi-pass Lower Bounds for MST in Dynamic Streams. STOC 2024: 835-846 - [c72]Sepehr Assadi, Christian Konrad, Kheeran K. Naidu, Janani Sundaresan:
O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set. STOC 2024: 847-858 - [i70]Sepehr Assadi:
Faster Vizing and Near-Vizing Edge Coloring Algorithms. CoRR abs/2405.13371 (2024) - [i69]Sepehr Assadi, Prantar Ghosh, Bruno Loff, Parth Mittal, Sagnik Mukhopadhyay:
Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy. CoRR abs/2405.14835 (2024) - [i68]Sepehr Assadi, Sanjeev Khanna:
Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemerédi Graphs. CoRR abs/2406.13573 (2024) - [i67]Sepehr Assadi, Soheil Behnezhad, Christian Konrad, Kheeran K. Naidu, Janani Sundaresan:
Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams. CoRR abs/2407.21005 (2024) - [i66]Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang:
Vizing's Theorem in Near-Linear Time. CoRR abs/2410.05240 (2024) - [i65]Sepehr Assadi, Aaron Bernstein, Zachary Langley, Lap Chi Lau, Robert Wang:
Streaming and Communication Complexity of Load-Balancing via Matching Contractors. CoRR abs/2410.16094 (2024) - 2023
- [j13]Sepehr Assadi:
Recent Advances in Multi-Pass Graph Streaming Lower Bounds. SIGACT News 54(3): 48-75 (2023) - [j12]Sepehr Assadi, Pankaj Kumar, Parth Mittal:
Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for Δ-Coloring. TheoretiCS 2 (2023) - [c71]Sepehr Assadi, Michael Kapralov, Huacheng Yu:
On Constructing Spanners from Random Gaussian Projections. APPROX/RANDOM 2023: 57:1-57:18 - [c70]Vikrant Ashvinkumar, Sepehr Assadi, Chengyuan Deng, Jie Gao, Chen Wang:
Evaluating Stability in Massive Social Networks: Efficient Streaming Algorithms for Structural Balance. APPROX/RANDOM 2023: 58:1-58:23 - [c69]Sepehr Assadi, Janani Sundaresan:
Hidden Permutations to the Rescue: Multi-Pass Streaming Lower Bounds for Approximate Matchings. FOCS 2023: 909-932 - [c68]Sepehr Assadi, Nirmit Joshi, Milind Prabhu, Vihan Shah:
Generalizing Greenwald-Khanna Streaming Quantile Summaries for Weighted Inputs. ICDT 2023: 19:1-19:19 - [c67]Sepehr Assadi, Aaron Bernstein, Zachary Langley:
All-Norm Load Balancing in Graph Streams via the Multiplicative Weights Update Method. ITCS 2023: 7:1-7:24 - [c66]Sepehr Assadi, Vihan Shah, Chen Wang:
Streaming Algorithms and Lower Bounds for Estimating Correlation Clustering Cost. NeurIPS 2023 - [c65]Sepehr Assadi, Amit Chakrabarti, Prantar Ghosh, Manuel Stoeckl:
Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms. PODS 2023: 141-153 - [c64]Sepehr Assadi, Vikram Kher, George Li, Ariel Schvartzman:
Fine-Grained Buy-Many Mechanisms Are Not Much Better Than Bundling. EC 2023: 123-152 - [c63]Sepehr Assadi, Martin Farach-Colton, William Kuszmaul:
Tight Bounds for Monotone Minimal Perfect Hashing. SODA 2023: 456-476 - [c62]Sepehr Assadi, Vihan Shah:
Tight Bounds for Vertex Connectivity in Dynamic Streams. SOSA 2023: 213-227 - [c61]Sepehr Assadi, Soheil Behnezhad, Sanjeev Khanna, Huan Li:
On Regularity Lemma and Barriers in Streaming and Dynamic Matching. STOC 2023: 131-144 - [c60]Sepehr Assadi, Janani Sundaresan:
(Noisy) Gap Cycle Counting Strikes Back: Random Order Streaming Lower Bounds for Connected Components and Beyond. STOC 2023: 183-195 - [i64]Sepehr Assadi, Aaron Bernstein, Zachary Langley:
All-Norm Load Balancing in Graph Streams via the Multiplicative Weights Update Method. CoRR abs/2301.07007 (2023) - [i63]Sepehr Assadi, Nirmit Joshi, Milind Prabhu, Vihan Shah:
Generalizing Greenwald-Khanna Streaming Quantile Summaries for Weighted Inputs. CoRR abs/2303.06288 (2023) - [i62]Sepehr Assadi, Janani Sundaresan:
(Noisy) Gap Cycle Counting Strikes Back: Random Order Streaming Lower Bounds for Connected Components and Beyond. CoRR abs/2305.11053 (2023) - [i61]Vikrant Ashvinkumar, Sepehr Assadi, Chengyuan Deng, Jie Gao, Chen Wang:
Evaluating Stability in Massive Social Networks: Efficient Streaming Algorithms for Structural Balance. CoRR abs/2306.00668 (2023) - [i60]Sepehr Assadi:
A Simple (1-ε)-Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching. CoRR abs/2307.02968 (2023) - [i59]Sepehr Assadi, Chen Wang:
The Best Arm Evades: Near-optimal Multi-pass Streaming Lower Bounds for Pure Exploration in Multi-armed Bandits. CoRR abs/2309.03145 (2023) - [i58]Sepehr Assadi, Janani Sundaresan:
Hidden Permutations to the Rescue: Multi-Pass Semi-Streaming Lower Bounds for Approximate Matchings. CoRR abs/2310.05728 (2023) - [i57]Sepehr Assadi, Gillat Kol, Zhijun Zhang:
Optimal Multi-Pass Lower Bounds for MST in Dynamic Streams. CoRR abs/2312.04674 (2023) - [i56]Sepehr Assadi, Christian Konrad, Kheeran K. Naidu, Janani Sundaresan:
O(log log n) Passes is Optimal for Semi-Streaming Maximal Independent Set. CoRR abs/2312.13178 (2023) - [i55]Sepehr Assadi, Gillat Kol, Zhijun Zhang:
Optimal Multi-Pass Lower Bounds for MST in Dynamic Streams. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j11]Sepehr Assadi, Hrishikesh Khandeparkar, Raghuvansh R. Saxena, S. Matthew Weinberg:
Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions. SIAM J. Comput. 51(3): 20-75 (2022) - [j10]Gautam Kamath, Sepehr Assadi, Anne Driemel, Janardhan Kulkarni:
Introduction to the Special Issue on ACM-SIAM Symposium on Discrete Algorithms (SODA) 2020. ACM Trans. Algorithms 18(4): 30:1-30:2 (2022) - [c59]Sepehr Assadi, Hoai-An Nguyen:
Asymptotically Optimal Bounds for Estimating H-Index in Sublinear Time with Applications to Subgraph Counting. APPROX/RANDOM 2022: 48:1-48:20 - [c58]Sepehr Assadi, Vaggos Chatziafratis, Jakub Lacki, Vahab Mirrokni, Chen Wang:
Hierarchical Clustering in Graph Streams: Single-Pass Algorithms and Space Lower Bounds. COLT 2022: 4643-4702 - [c57]Sepehr Assadi, Gillat Kol, Zhijun Zhang:
Rounds vs Communication Tradeoffs for Maximal Independent Sets. FOCS 2022: 1193-1204 - [c56]Sepehr Assadi, Aaron Bernstein, Aditi Dudeja:
Decremental Matching in General Graphs. ICALP 2022: 11:1-11:19 - [c55]Sepehr Assadi, Vihan Shah:
An Asymptotically Optimal Algorithm for Maximum Matching in Dynamic Streams. ITCS 2022: 9:1-9:23 - [c54]Sepehr Assadi, Chen Wang:
Sublinear Time and Space Algorithms for Correlation Clustering via Sparse-Dense Decompositions. ITCS 2022: 10:1-10:20 - [c53]Sepehr Assadi, Chen Wang:
Single-pass Streaming Lower Bounds for Multi-armed Bandits Exploration with Instance-sensitive Sample Complexity. NeurIPS 2022 - [c52]Chaoji Zuo, Sepehr Assadi, Dong Deng:
Spine: Scaling up Programming-by-Negative-Example for String Filtering and Transformation. SIGMOD Conference 2022: 521-530 - [c51]Sepehr Assadi, Arun Jambulapati, Yujia Jin, Aaron Sidford, Kevin Tian:
Semi-Streaming Bipartite Matching in Fewer Passes and Optimal Space. SODA 2022: 627-669 - [c50]Sepehr Assadi:
A Two-Pass (Conditional) Lower Bound for Semi-Streaming Maximum Matching. SODA 2022: 708-742 - [c49]Sepehr Assadi, Pankaj Kumar, Parth Mittal:
Brooks' theorem in graph streams: a single-pass semi-streaming algorithm for ∆-coloring. STOC 2022: 234-247 - [c48]Sepehr Assadi, Andrew Chen, Glenn Sun:
Deterministic graph coloring in the streaming model. STOC 2022: 261-274 - [c47]Sepehr Assadi:
Graph Coloring, Palette Sparsification, and Beyond (Invited Talk). DISC 2022: 1:1-1:1 - [i54]Sepehr Assadi, Vihan Shah:
An Asymptotically Optimal Algorithm for Maximum Matching in Dynamic Streams. CoRR abs/2201.12710 (2022) - [i53]Sepehr Assadi, Pankaj Kumar, Parth Mittal:
Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for Δ-Coloring. CoRR abs/2203.10984 (2022) - [i52]Sepehr Assadi, Ariel Schvartzman:
Fine-Grained Buy-Many Mechanisms Are Not Much Better Than Bundling. CoRR abs/2205.14312 (2022) - [i51]Sepehr Assadi, Vaggos Chatziafratis, Jakub Lacki, Vahab S. Mirrokni, Chen Wang:
Hierarchical Clustering in Graph Streams: Single-Pass Algorithms and Space Lower Bounds. CoRR abs/2206.07554 (2022) - [i50]Sepehr Assadi, Aaron Bernstein, Aditi Dudeja:
Decremental Matching in General Graphs. CoRR abs/2207.00927 (2022) - [i49]Sepehr Assadi, Soheil Behnezhad, Sanjeev Khanna, Huan Li:
On Regularity Lemma and Barriers in Streaming and Dynamic Matching. CoRR abs/2207.09354 (2022) - [i48]Sepehr Assadi, Martin Farach-Colton, William Kuszmaul:
Tight Bounds for Monotone Minimal Perfect Hashing. CoRR abs/2207.10556 (2022) - [i47]Sepehr Assadi, Hoai-An Nguyen:
Asymptotically Optimal Bounds for Estimating H-Index in Sublinear Time with Applications to Subgraph Counting. CoRR abs/2209.08114 (2022) - [i46]Sepehr Assadi, Gillat Kol, Zhijun Zhang:
Rounds vs Communication Tradeoffs for Maximal Independent Sets. CoRR abs/2209.09049 (2022) - [i45]Sepehr Assadi, Michael Kapralov, Huacheng Yu:
On Constructing Spanners from Random Gaussian Projections. CoRR abs/2209.14775 (2022) - [i44]Sepehr Assadi, Vihan Shah:
Tight Bounds for Vertex Connectivity in Dynamic Streams. CoRR abs/2211.04685 (2022) - [i43]Sepehr Assadi, Amit Chakrabarti, Prantar Ghosh, Manuel Stoeckl:
Coloring in Graph Streams via Deterministic and Adversarially Robust Algorithms. CoRR abs/2212.10641 (2022) - [i42]Sepehr Assadi, Gillat Kol, Zhijun Zhang:
Rounds vs Communication Tradeoffs for Maximal Independent Sets. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j9]Sepehr Assadi, Sanjeev Khanna, Yang Li:
Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem. SIAM J. Comput. 50(3) (2021) - [c46]Sepehr Assadi, Soheil Behnezhad:
On the Robust Communication Complexity of Bipartite Matching. APPROX-RANDOM 2021: 48:1-48:17 - [c45]Sepehr Assadi, Deeparnab Chakrabarty, Sanjeev Khanna:
Graph Connectivity and Single Element Recovery via Linear and OR Queries. ESA 2021: 7:1-7:19 - [c44]Sepehr Assadi, Shay Solomon:
Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach. ESA 2021: 8:1-8:18 - [c43]Sepehr Assadi, Soheil Behnezhad:
Beating Two-Thirds For Random-Order Streaming Matching. ICALP 2021: 19:1-19:13 - [c42]Sepehr Assadi, Thomas Kesselheim, Sahil Singla:
Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier. SODA 2021: 653-661 - [c41]Sepehr Assadi, S. Cliff Liu, Robert E. Tarjan:
An Auction Algorithm for Bipartite Matching in Streaming and Massively Parallel Computation Models. SOSA 2021: 165-171 - [c40]Sepehr Assadi, Aditi Dudeja:
A Simple Semi-Streaming Algorithm for Global Minimum Cuts. SOSA 2021: 172-180 - [c39]Sepehr Assadi, Vishvajeet N:
Graph streaming lower bounds for parameter estimation and property testing via a streaming XOR lemma. STOC 2021: 612-625 - [c38]Sepehr Assadi, Aditi Dudeja:
Ruling Sets in Random Order and Adversarial Streams. DISC 2021: 6:1-6:18 - [i41]Sepehr Assadi, Soheil Behnezhad:
Beating Two-Thirds For Random-Order Streaming Matching. CoRR abs/2102.07011 (2021) - [i40]Sepehr Assadi, Vishvajeet N:
Graph Streaming Lower Bounds for Parameter Estimation and Property Testing via a Streaming XOR Lemma. CoRR abs/2104.04908 (2021) - [i39]Sepehr Assadi, Shay Solomon:
Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach. CoRR abs/2105.06889 (2021) - [i38]Sepehr Assadi:
A Two-Pass Lower Bound for Semi-Streaming Maximum Matching. CoRR abs/2108.07187 (2021) - [i37]Sepehr Assadi, Chen Wang:
Sublinear Time and Space Algorithms for Correlation Clustering via Sparse-Dense Decompositions. CoRR abs/2109.14528 (2021) - [i36]Sepehr Assadi, Andrew Chen, Glenn Sun:
Deterministic Graph Coloring in the Streaming Model. CoRR abs/2109.14891 (2021) - 2020
- [j8]Sepehr Assadi, Sahil Singla:
Improved truthful mechanisms for combinatorial auctions with submodular bidders. SIGecom Exch. 18(1): 19-27 (2020) - [j7]Sepehr Assadi:
Combinatorial Auctions Do Need Modest Interaction. ACM Trans. Economics and Comput. 8(1): 3:1-3:23 (2020) - [c37]Noga Alon, Sepehr Assadi:
Palette Sparsification Beyond (Δ+1) Vertex Coloring. APPROX-RANDOM 2020: 6:1-6:22 - [c36]Sepehr Assadi, Ran Raz:
Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms. FOCS 2020: 342-353 - [c35]Sepehr Assadi, Gillat Kol, Raghuvansh R. Saxena, Huacheng Yu:
Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems. FOCS 2020: 354-364 - [c34]Sepehr Assadi, Gillat Kol, Rotem Oshman:
Lower Bounds for Distributed Sketching of Maximal Matchings and Maximal Independent Sets. PODC 2020: 79-88 - [c33]Sepehr Assadi, Hrishikesh Khandeparkar, Raghuvansh R. Saxena, S. Matthew Weinberg:
Separating the communication complexity of truthful and non-truthful combinatorial auctions. STOC 2020: 1073-1085 - [c32]Sepehr Assadi, Chen Wang:
Exploration with limited memory: streaming algorithms for coin tossing, noisy comparisons, and multi-armed bandits. STOC 2020: 1237-1250 - [c31]Sepehr Assadi, Aaron Bernstein, Zachary Langley:
Improved Bounds for Distributed Load Balancing. DISC 2020: 1:1-1:15 - [i35]Sepehr Assadi, Chen Wang:
Exploration with Limited Memory: Streaming Algorithms for Coin Tossing, Noisy Comparisons, and Multi-Armed Bandits. CoRR abs/2004.04666 (2020) - [i34]Sepehr Assadi, Shay Solomon:
When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear-Time. CoRR abs/2006.07628 (2020) - [i33]Noga Alon, Sepehr Assadi:
Palette Sparsification Beyond (Δ+1) Vertex Coloring. CoRR abs/2006.10456 (2020) - [i32]Sepehr Assadi, Deeparnab Chakrabarty, Sanjeev Khanna:
Graph Connectivity and Single Element Recovery via Linear and OR Queries. CoRR abs/2007.06098 (2020) - [i31]Sepehr Assadi, Aaron Bernstein, Zachary Langley:
Improved Bounds for Distributed Load Balancing. CoRR abs/2008.04148 (2020) - [i30]Sepehr Assadi, Ran Raz:
Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms. CoRR abs/2009.01161 (2020) - [i29]Sepehr Assadi, Gillat Kol, Raghuvansh R. Saxena, Huacheng Yu:
Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems. CoRR abs/2009.03038 (2020) - [i28]Sepehr Assadi, Thomas Kesselheim, Sahil Singla:
Improved Truthful Mechanisms for Subadditive Combinatorial Auctions: Breaking the Logarithmic Barrier. CoRR abs/2010.01420 (2020) - [i27]Sepehr Assadi, Hrishikesh Khandeparkar, Raghuvansh R. Saxena, S. Matthew Weinberg:
Separating the Communication Complexity of Truthful and Non-Truthful Combinatorial Auctions. CoRR abs/2011.07414 (2020)
2010 – 2019
- 2019
- [j6]Sepehr Assadi, Sanjeev Khanna, Yang Li:
The Stochastic Matching Problem with (Very) Few Queries. ACM Trans. Economics and Comput. 7(3): 16:1-16:19 (2019) - [c30]Sepehr Assadi, Sahil Singla:
Improved Truthful Mechanisms for Combinatorial Auctions with Submodular Bidders. FOCS 2019: 233-248 - [c29]Sepehr Assadi, Shay Solomon:
When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time. ICALP 2019: 17:1-17:17 - [c28]Sepehr Assadi, MohammadHossein Bateni, Vahab S. Mirrokni:
Distributed Weighted Matching via Randomized Composable Coresets. ICML 2019: 333-343 - [c27]Sepehr Assadi, Michael Kapralov, Sanjeev Khanna:
A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling. ITCS 2019: 6:1-6:20 - [c26]Sepehr Assadi, Eric Balkanski, Renato Paes Leme:
Secretary Ranking with Minimal Inversions. NeurIPS 2019: 1049-1061 - [c25]Sepehr Assadi, Xiaorui Sun, Omri Weinstein:
Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs. PODC 2019: 461-470 - [c24]Sepehr Assadi, Nikolai Karpov, Qin Zhang:
Distributed and Streaming Linear Programming in Low Dimensions. PODS 2019: 236-253 - [c23]Sepehr Assadi, Aaron Bernstein:
Towards a Unified Theory of Sparsification for Matching Problems. SOSA 2019: 11:1-11:20 - [c22]Arpit Agarwal, Sepehr Assadi, Sanjeev Khanna:
Stochastic Submodular Cover with Limited Adaptivity. SODA 2019: 323-342 - [c21]Sepehr Assadi, Yu Chen, Sanjeev Khanna:
Sublinear Algorithms for (Δ + 1) Vertex Coloring. SODA 2019: 767-786 - [c20]Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, Vahab S. Mirrokni, Cliff Stein:
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs. SODA 2019: 1616-1635 - [c19]Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon:
Fully Dynamic Maximal Independent Set with Sublinear in n Update Time. SODA 2019: 1919-1936 - [c18]Sepehr Assadi, Yu Chen, Sanjeev Khanna:
Polynomial pass lower bounds for graph streaming algorithms. STOC 2019: 265-276 - [i26]Sepehr Assadi, Nikolai Karpov, Qin Zhang:
Distributed and Streaming Linear Programming in Low Dimensions. CoRR abs/1903.05617 (2019) - [i25]Sepehr Assadi, Yu Chen, Sanjeev Khanna:
Polynomial Pass Lower Bounds for Graph Streaming Algorithms. CoRR abs/1904.04720 (2019) - [i24]Sepehr Assadi, MohammadHossein Bateni, Vahab S. Mirrokni:
Distributed Weighted Matching via Randomized Composable Coresets. CoRR abs/1906.01993 (2019) - [i23]Sepehr Assadi, Sahil Singla:
Improved Truthful Mechanisms for Combinatorial Auctions with Submodular Bidders. CoRR abs/1911.02716 (2019) - 2018
- [c17]Sepehr Assadi, Sanjeev Khanna:
Tight Bounds on the Round Complexity of the Distributed Maximum Coverage Problem. SODA 2018: 2412-2431 - [c16]Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon:
Fully dynamic maximal independent set with sublinear update time. STOC 2018: 815-826 - [i22]Sepehr Assadi, Sanjeev Khanna:
Tight Bounds on the Round Complexity of the Distributed Maximum Coverage Problem. CoRR abs/1801.02793 (2018) - [i21]Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon:
Fully Dynamic Maximal Independent Set with Sublinear Update Time. CoRR abs/1802.09709 (2018) - [i20]Sepehr Assadi, Xiaorui Sun, Omri Weinstein:
Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs. CoRR abs/1805.02974 (2018) - [i19]Sepehr Assadi, Krzysztof Onak, Baruch Schieber, Shay Solomon:
Fully Dynamic Maximal Independent Set with Sublinear in n Update Time. CoRR abs/1806.10051 (2018) - [i18]Sepehr Assadi, Yu Chen, Sanjeev Khanna:
Sublinear Algorithms for (Δ+ 1) Vertex Coloring. CoRR abs/1807.08886 (2018) - [i17]Arpit Agarwal, Sepehr Assadi, Sanjeev Khanna:
Stochastic Submodular Cover with Limited Adaptivity. CoRR abs/1810.13351 (2018) - [i16]Sepehr Assadi, Aaron Bernstein:
Towards a Unified Theory of Sparsification for Matching Problems. CoRR abs/1811.02009 (2018) - [i15]Sepehr Assadi, Eric Balkanski, Renato Paes Leme:
Secretary Ranking with Minimal Inversions. CoRR abs/1811.06444 (2018) - [i14]Sepehr Assadi, Michael Kapralov, Sanjeev Khanna:
A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling. CoRR abs/1811.07780 (2018) - 2017
- [j5]Sepehr Assadi:
SPAA 2017 Review. SIGACT News 48(4): 87-90 (2017) - [j4]AmirMahdi Ahmadinejad, Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Sadra Yazdanbod, Hamid Zarrabi-Zadeh:
On the rectangle escape problem. Theor. Comput. Sci. 689: 126-136 (2017) - [j3]Sepehr Assadi, Sanjeev Khanna, Yang Li, Rakesh Vohra:
Fast Convergence in the Double Oral Auction. ACM Trans. Economics and Comput. 5(4): 20:1-20:18 (2017) - [c15]Arpit Agarwal, Shivani Agarwal, Sepehr Assadi, Sanjeev Khanna:
Learning with Limited Rounds of Adaptivity: Coin Tossing, Multi-Armed Bandits, and Ranking from Pairwise Comparisons. COLT 2017: 39-75 - [c14]Sepehr Assadi:
Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem. PODS 2017: 321-335 - [c13]Sepehr Assadi, Sanjeev Khanna, Yang Li:
The Stochastic Matching Problem: Beating Half with a Non-Adaptive Algorithm. EC 2017: 99-116 - [c12]Sepehr Assadi:
Combinatorial Auctions Do Need Modest Interaction. EC 2017: 145-162 - [c11]Sepehr Assadi, Sanjeev Khanna, Yang Li:
On Estimating Maximum Matching Size in Graph Streams. SODA 2017: 1723-1742 - [c10]Sepehr Assadi, Sanjeev Khanna:
Randomized Composable Coresets for Matching and Vertex Cover. SPAA 2017: 3-12 - [i13]Sepehr Assadi, Sanjeev Khanna, Yang Li:
On Estimating Maximum Matching Size in Graph Streams. CoRR abs/1701.04364 (2017) - [i12]Sepehr Assadi:
Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set Cover Problem. CoRR abs/1703.01847 (2017) - [i11]Sepehr Assadi:
Combinatorial Auctions Do Need Modest Interaction. CoRR abs/1705.01644 (2017) - [i10]Sepehr Assadi, Sanjeev Khanna, Yang Li:
The Stochastic Matching Problem: Beating Half with a Non-Adaptive Algorithm. CoRR abs/1705.02280 (2017) - [i9]Sepehr Assadi, Sanjeev Khanna:
Randomized Composable Coresets for Matching and Vertex Cover. CoRR abs/1705.08242 (2017) - [i8]Sepehr Assadi:
Simple Round Compression for Parallel Vertex Cover. CoRR abs/1709.04599 (2017) - [i7]Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, Vahab S. Mirrokni, Cliff Stein:
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs. CoRR abs/1711.03076 (2017) - 2016
- [j2]Morteza Mohajjel Kafshdooz, Mohammadkazem Taram, Sepehr Assadi, Alireza Ejlali:
A Compile-Time Optimization Method for WCET Reduction in Real-Time Embedded Systems through Block Formation. ACM Trans. Archit. Code Optim. 12(4): 66:1-66:25 (2016) - [c9]Sepehr Assadi, Sanjeev Khanna, Yang Li, Val Tannen:
Algorithms for Provisioning Queries and Analytics. ICDT 2016: 18:1-18:18 - [c8]Sepehr Assadi, Sanjeev Khanna, Yang Li:
The Stochastic Matching Problem with (Very) Few Queries. EC 2016: 43-60 - [c7]Sepehr Assadi, Sanjeev Khanna, Yang Li, Grigory Yaroslavtsev:
Maximum Matchings in Dynamic Graph Streams and the Simultaneous Communication Model. SODA 2016: 1345-1364 - [c6]Sepehr Assadi, Sanjeev Khanna, Yang Li:
Tight bounds for single-pass streaming complexity of the set cover problem. STOC 2016: 698-711 - [i6]Sepehr Assadi, Sanjeev Khanna, Yang Li:
Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem. CoRR abs/1603.05715 (2016) - 2015
- [c5]Sepehr Assadi, Sanjeev Khanna, Yang Li, Val Tannen:
Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches. FSTTCS 2015: 52-68 - [c4]Sepehr Assadi, Justin Hsu, Shahin Jabbari:
Online Assignment of Heterogeneous Tasks in Crowdsourcing Markets. HCOMP 2015: 12-21 - [c3]Sepehr Assadi, Sanjeev Khanna, Yang Li, Rakesh V. Vohra:
Fast Convergence in the Double Oral Auction. WINE 2015: 60-73 - [i5]Sepehr Assadi, Sanjeev Khanna, Yang Li, Grigory Yaroslavtsev:
Tight Bounds for Linear Sketches of Approximate Matchings. CoRR abs/1505.01467 (2015) - [i4]Sepehr Assadi, Justin Hsu, Shahin Jabbari:
Online Assignment of Heterogeneous Tasks in Crowdsourcing Markets. CoRR abs/1508.03593 (2015) - [i3]Sepehr Assadi, Sanjeev Khanna, Yang Li, Rakesh Vohra:
Fast Convergence in the Double Oral Auction. CoRR abs/1510.00086 (2015) - [i2]Sepehr Assadi, Sanjeev Khanna, Yang Li, Val Tannen:
Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches. CoRR abs/1510.03252 (2015) - [i1]Sepehr Assadi, Sanjeev Khanna, Yang Li, Val Tannen:
Algorithms for Provisioning Queries and Analytics. CoRR abs/1512.06143 (2015) - 2014
- [j1]Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Ashkan Norouzi-Fard, Sadra Yazdanbod, Hamid Zarrabi-Zadeh:
The Minimum Vulnerability Problem. Algorithmica 70(4): 718-731 (2014) - 2013
- [c2]Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Sadra Yazdanbod, Hamid Zarrabi-Zadeh:
On the Rectangle Escape Problem. CCCG 2013 - 2012
- [c1]Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Ashkan Norouzi-Fard, Sadra Yazdanbod, Hamid Zarrabi-Zadeh:
The Minimum Vulnerability Problem. ISAAC 2012: 382-391
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-24 00:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
