| Scalable fair clustering A Backurs, P Indyk, K Onak, B Schieber, A Vakilian, T Wagner International Conference on Machine Learning, 405-413, 2019 | 230 | 2019 |
| Learning-based frequency estimation algorithms CY Hsu, P Indyk, D Katabi, A Vakilian International Conference on Learning Representations, 2019 | 155 | 2019 |
| Individual fairness for -clustering S Mahabadi, A Vakilian International conference on machine learning, 6586-6596, 2020 | 79 | 2020 |
| Learning-based low-rank approximations P Indyk, A Vakilian, Y Yuan Advances in Neural Information Processing Systems, 7402-7412, 2019 | 53 | 2019 |
| Approximation algorithms for socially fair clustering Y Makarychev, A Vakilian Conference on Learning Theory, 3246-3264, 2021 | 45 | 2021 |
| Towards tight bounds for the streaming set cover problem S Har-Peled, P Indyk, S Mahabadi, A Vakilian Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2016 | 43* | 2016 |
| On streaming and communication complexity of the set cover problem ED Demaine, P Indyk, S Mahabadi, A Vakilian Distributed Computing: 28th International Symposium, DISC 2014, Austin, TX …, 2014 | 43 | 2014 |
| Improved approximation algorithms for individually fair clustering A Vakilian, M Yalciner International Conference on Artificial Intelligence and Statistics, 8758-8779, 2022 | 40 | 2022 |
| Faster fundamental graph algorithms via learned predictions J Chen, S Silwal, A Vakilian, F Zhang International Conference on Machine Learning, 3583-3602, 2022 | 39 | 2022 |
| Sample-optimal low-rank approximation of distance matrices P Indyk, A Vakilian, T Wagner, DP Woodruff Conference on Learning Theory, 1723-1751, 2019 | 30 | 2019 |
| Approximating Fair Clustering with Cascaded Norm Objectives E Chlamtáč, Y Makarychev, A Vakilian Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | 26 | 2022 |
| Prize-collecting survivable network design in node-weighted graphs C Chekuri, A Ene, A Vakilian International Workshop on Approximation Algorithms for Combinatorial …, 2012 | 25 | 2012 |
| Learning Online Algorithms with Distributional Advice I Diakonikolas, V Kontonis, C Tzamos, A Vakilian, N Zarifis International Conference on Machine Learning, 2687-2696, 2021 | 24 | 2021 |
| Node-weighted network design in planar and minor-closed families of graphs C Chekuri, A Ene, A Vakilian ACM Transactions on Algorithms (TALG) 17 (2), 1-25, 2021 | 22 | 2021 |
| Local Computation Algorithms for Spanners M Parter, R Rubinfeld, A Vakilian, A Yodpinyanee 10th Innovations in Theoretical Computer Science Conference (ITCS 2019), 2019 | 22 | 2019 |
| Fractional set cover in the streaming model P Indyk, S Mahabadi, R Rubinfeld, J Ullman, A Vakilian, A Yodpinyanee 20th International Workshop on Approximation Algorithms for Combinatorial …, 2017 | 20 | 2017 |
| Learning the positions in countsketch Y Li, H Lin, S Liu, A Vakilian, DP Woodruff arXiv preprint arXiv:2306.06611, 2023 | 18* | 2023 |
| (Learned) Frequency Estimation Algorithms under Zipfian Distribution A Aamand, P Indyk, A Vakilian arXiv preprint arXiv:1908.05198, 2019 | 18* | 2019 |
| Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model P Indyk, A Vakilian Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2019 | 15 | 2019 |
| Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class ED Demaine, TD Goodrich, K Kloster, B Lavallee, QC Liu, BD Sullivan, ... arXiv preprint arXiv:1806.02771, 2018 | 14 | 2018 |
Piotr IndykProfessor of Electrical Engineering and Computer Science, MIT在 mit.edu 的电子邮件经过验证
