Sepehr Assadi

Cited by

	All	Since 2017
Citations	1302	1251
h-index	20	20
i10-index	34	34

320

160

240

2015201620172018201920202021202214 29 69 151 219 263 311 232

Public access

View all

29 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Sanjeev KhannaHenry Salvatori Professor of Computer Science, University of PennsylvaniaVerified email at cis.upenn.edu
Yang LiFacebook Inc.Verified email at fb.com
Aaron BernsteinProfessor of Computer Science, Rutgers UniversityVerified email at rutgers.edu
Vahab MirrokniDistinguished Scientist, Google Research, New YorkVerified email at google.com
Mohammad Hossein BateniResearch scientist, GoogleVerified email at cs.princeton.edu
Grigory YaroslavtsevAssistant Professor, George Mason UniversityVerified email at grigory.us
Shay SolomonTel Aviv UniversityVerified email at tauex.tau.ac.il
Yu ChenUniversity of PennsylvaniaVerified email at seas.upenn.edu
Arpit AgarwalPostdoctoral Research Fellow, Columbia UniversityVerified email at columbia.edu
Hamid Zarrabi-ZadehSharif University of TechnologyVerified email at sharif.edu
Sadra YazdanbodGeorgia Institute of TechnologyVerified email at gatech.edu
Ehsan Emamjomeh-ZadehResearch Scientist at Facebook Inc.Verified email at fb.com
Clifford SteinProfessor of IEOR and CS, Columbia UniversityVerified email at ieor.columbia.edu
Soheil BehnezhadStanford UniversityVerified email at stanford.edu
Shivani AgarwalUniversity of PennsylvaniaVerified email at seas.upenn.edu
Sahil SinglaAssistant Professor, School of Computer Science, Georgia TechVerified email at gatech.edu
Chen WangRutgers UniversityVerified email at rutgers.edu
Baruch SchieberNew Jersey Institute of TechnologyVerified email at njit.edu
Krzysztof OnakBoston UniversityVerified email at onak.pl
Xiaorui SunUniversity of Illinois at ChicagoVerified email at uic.edu

Sepehr Assadi

Assistant Professor, Rutgers University

Verified email at rutgers.edu - Homepage

Streaming algorithms Sublinear algorithms Communication complexity Theoretical computer science


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Maximum matchings in dynamic graph streams and the simultaneous communication model S Assadi, S Khanna, Y Li, G Yaroslavtsev Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016	115*	2016
Coresets meet EDCS: algorithms for matching and vertex cover on massive graphs S Assadi, MH Bateni, A Bernstein, V Mirrokni, C Stein Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019	98	2019
On Estimating Maximum Matching Size in Graph Streams S Assadi, S Khanna, Y Li Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017	89	2017
Learning with Limited Rounds of Adaptivity: Coin Tossing, Multi-Armed Bandits, and Ranking from Pairwise Comparisons A Agarwal, S Agarwal, S Assadi, S Khanna Conference on Learning Theory, 39-75, 2017	78	2017
Sublinear Algorithms for (Δ+ 1) Vertex Coloring S Assadi, Y Chen, S Khanna Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019	76	2019
Fully Dynamic Maximal Independent Set with Sublinear in n Update Time S Assadi, K Onak, B Schieber, S Solomon Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019	54	2019
The stochastic matching problem with (very) few queries S Assadi, S Khanna, Y Li ACM Transactions on Economics and Computation (TEAC) 7 (3), 1-19, 2019	51	2019
Massively parallel algorithms for finding well-connected components in sparse graphs S Assadi, X Sun, O Weinstein Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019	48	2019
Randomized Composable Coresets for Matching and Vertex Cover S Assadi, S Khanna Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and …, 2017	48	2017
A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling S Assadi, M Kapralov, S Khanna arXiv preprint arXiv:1811.07780, 2018	46	2018
Tight bounds for single-pass streaming complexity of the set cover problem S Assadi, S Khanna, Y Li Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing …, 2016	46	2016
Online Assignment of Heterogeneous Tasks in Crowdsourcing Markets S Assadi, J Hsu, S Jabbari Third AAAI Conference on Human Computation and Crowdsourcing, 2015	45	2015
Towards a unified theory of sparsification for matching problems S Assadi, A Bernstein 2nd Symposium on Simplicity in Algorithms (SOSA 2019), 2018	41	2018
Simple Round Compression for Parallel Vertex Cover S Assadi arXiv preprint arXiv:1709.04599, 2017	28	2017
The Stochastic Matching Problem: Beating Half with a Non-Adaptive Algorithm S Assadi, S Khanna, Y Li Proceedings of the 2017 ACM Conference on Economics and Computation, 99--116, 2017	27	2017
Complexity of the Minimum Input Selection Problem for Structural Controllability S Assadi, S Khanna, Y Li, VM Preciado IFAC-PapersOnLine 48 (22), 70-75, 2015	27	2015
The minimum vulnerability problem S Assadi, E Emamjomeh-Zadeh, A Norouzi-Fard, S Yazdanbod, ... Algorithmica 70 (4), 718-731, 2014	26	2014
Tight space-approximation tradeoff for the multi-pass streaming set cover problem S Assadi Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2017	24	2017
Combinatorial auctions do need modest interaction S Assadi Proceedings of the 2017 ACM Conference on Economics and Computation, 145--162, 2017	24	2017
Improved truthful mechanisms for combinatorial auctions with submodular bidders S Assadi, S Singla 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019	21	2019

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors