| 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 | 140* | 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 | 131 | 2019 |
| Sublinear Algorithms for (Δ+ 1) Vertex Coloring S Assadi, Y Chen, S Khanna Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 125 | 2019 |
| 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 | 113 | 2017 |
| 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 | 109 | 2017 |
| 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 | 77 | 2019 |
| A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling S Assadi, M Kapralov, S Khanna 10th Innovations in Theoretical Computer Science Conference, ITCS 2019 …, 2018 | 72 | 2018 |
| 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 | 70 | 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 | 64 | 2019 |
| 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 | 61 | 2016 |
| Online Assignment of Heterogeneous Tasks in Crowdsourcing Markets S Assadi, J Hsu, S Jabbari Third AAAI Conference on Human Computation and Crowdsourcing, 2015 | 57 | 2015 |
| Towards a unified theory of sparsification for matching problems S Assadi, A Bernstein 2nd Symposium on Simplicity in Algorithms (SOSA 2019), 2018 | 55 | 2018 |
| Randomized Composable Coresets for Matching and Vertex Cover S Assadi, S Khanna Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and …, 2017 | 55 | 2017 |
| Beating Two-Thirds For Random-Order Streaming Matching S Assadi, S Behnezhad 48th International Colloquium on Automata, Languages, and Programming, ICALP …, 2021 | 44 | 2021 |
| 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 | 40 | 2019 |
| Near-quadratic lower bounds for two-pass graph streaming algorithms S Assadi, R Raz 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 38 | 2020 |
| Multi-pass graph streaming lower bounds for cycle counting, max-cut, matching size, and other problems S Assadi, G Kol, RR Saxena, H Yu 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 37 | 2020 |
| Palette Sparsification Beyond Vertex Coloring N Alon, S Assadi Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2020 | 37 | 2020 |
| Semi-Streaming Bipartite Matching in Fewer Passes and Optimal Space∗ S Assadi, A Jambulapati, Y Jin, A Sidford, K Tian Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | 34 | 2022 |
| 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 | 34 | 2017 |
Sanjeev KhannaHenry Salvatori Professor of Computer Science, University of Pennsylvania在 cis.upenn.edu 的电子邮件经过验证
