Sepehr Assadi
Sepehr Assadi
Assistant Professor, Rutgers University
Подтвержден адрес электронной почты в домене rutgers.edu - Главная страница
Название
Процитировано
Процитировано
Год
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
103*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
792019
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
792017
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
622017
Sublinear Algorithms for (Δ+ 1) Vertex Coloring
S Assadi, Y Chen, S Khanna
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
582019
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
562019
Randomized Composable Coresets for Matching and Vertex Cover
S Assadi, S Khanna
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and …, 2017
422017
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
422016
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
412019
Online Assignment of Heterogeneous Tasks in Crowdsourcing Markets
S Assadi, J Hsu, S Jabbari
Third AAAI Conference on Human Computation and Crowdsourcing, 2015
402015
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
392019
A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling
S Assadi, M Kapralov, S Khanna
arXiv preprint arXiv:1811.07780, 2018
372018
Towards a unified theory of sparsification for matching problems
S Assadi, A Bernstein
2nd Symposium on Simplicity in Algorithms (SOSA 2019), 2018
282018
Simple Round Compression for Parallel Vertex Cover
S Assadi
arXiv preprint arXiv:1709.04599, 2017
262017
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
232015
The minimum vulnerability problem
S Assadi, E Emamjomeh-Zadeh, A Norouzi-Fard, S Yazdanbod, ...
Algorithmica 70 (4), 718-731, 2014
232014
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
222017
Combinatorial auctions do need modest interaction
S Assadi
Proceedings of the 2017 ACM Conference on Economics and Computation, 145--162, 2017
212017
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
192017
Tight Bounds on the Round Complexity of the Distributed Maximum Coverage Problem
S Assadi, S Khanna
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
132018
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20