| Improved massively parallel computation algorithms for mis, matching, and vertex cover M Ghaffari, T Gouleakis, C Konrad, S Mitrović, R Rubinfeld Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing …, 2018 | 107 | 2018 |
| Round compression for parallel matching algorithms A Czumaj, J Łącki, A Mądry, S Mitrović, K Onak, P Sankowski Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 85 | 2018 |
| Beyond 1/2-approximation for submodular maximization on massive data streams A Norouzi-Fard, J Tarnawski, S Mitrovic, A Zandieh, A Mousavifar, ... International Conference on Machine Learning, 3829-3838, 2018 | 69 | 2018 |
| Weighted matchings via unweighted augmentations B Gamlath, S Kale, S Mitrovic, O Svensson Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019 | 60 | 2019 |
| Robust submodular maximization: A non-uniform partitioning approach I Bogunovic, S Mitrović, J Scarlett, V Cevher Proceedings of the 34th International Conference on Machine Learning-Volume …, 2017 | 51 | 2017 |
| Streaming robust submodular maximization: A partitioned thresholding approach S Mitrovic, I Bogunovic, A Norouzi-Fard, JM Tarnawski, V Cevher Advances in Neural Information Processing Systems, 4557-4566, 2017 | 41 | 2017 |
| On the Resiliency of Static Forwarding Tables M Chiesa, I Nikolaevskiy, S Mitrović, A Gurtov, A Madry, M Schapira, ... IEEE/ACM Transactions on Networking 25 (2), 1133-1146, 2017 | 40 | 2017 |
| The Quest for Resilient (Static) Forwarding Tables M Chiesa, I Nikolaevskiy, S Mitrovic, A Panda, A Gurtov, A Madry, ... | 32* | |
| Space efficient approximation to maximum matching size from uniform edge samples M Kapralov, S Mitrović, A Norouzi-Fard, J Tardos Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 31 | 2020 |
| On the resiliency of randomized routing against multiple edge failures M Chiesa, A Gurtov, A Madry, S Mitrovic, I Nikolaevskiy, M Shapira, ... 43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016 | 31 | 2016 |
| Improved Parallel Algorithms for Density-Based Network Clustering M Ghaffari, S Lattanzi, S Mitrović International Conference on Machine Learning, 2201-2210, 2019 | 29 | 2019 |
| Exploring the limits of static failover routing M Chiesa, A Gurtov, A Mądry, S Mitrović, I Nikolaevkiy, A Panda, ... arXiv preprint arXiv:1409.0034, 2014 | 19 | 2014 |
| Walking randomly, massively, and efficiently J Łącki, S Mitrović, K Onak, P Sankowski Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 16 | 2020 |
| Fairness in Streaming Submodular Maximization: Algorithms and Hardness M El Halabi, S Mitrović, A Norouzi-Fard, J Tardos, JM Tarnawski Advances in Neural Information Processing Systems 33, 2020 | 14 | 2020 |
| Adversarially robust submodular maximization under knapsack constraints D Avdiukhin, S Mitrović, G Yaroslavtsev, S Zhou Proceedings of the 25th ACM SIGKDD International Conference on Knowledge …, 2019 | 14 | 2019 |
| Correlation clustering in constant many parallel rounds V Cohen-Addad, S Lattanzi, S Mitrović, A Norouzi-Fard, N Parotsidis, ... International Conference on Machine Learning, 2069-2078, 2021 | 13 | 2021 |
| Online page migration with ML advice P Indyk, F Mallmann-Trenn, S Mitrovic, R Rubinfeld International Conference on Artificial Intelligence and Statistics, 1655-1670, 2022 | 12 | 2022 |
| Homometric sets in trees R Fulek, S Mitrović European Journal of Combinatorics 35, 256-263, 2014 | 11 | 2014 |
| Massively parallel algorithms for distance approximation and spanners AS Biswas, M Dory, M Ghaffari, S Mitrović, Y Nazari Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and …, 2021 | 8 | 2021 |
| Fully dynamic algorithm for constrained submodular optimization S Lattanzi, S Mitrović, A Norouzi-Fard, JM Tarnawski, M Zadimoghaddam Advances in Neural Information Processing Systems 33, 12923-12933, 2020 | 8 | 2020 |
Aleksander MądryMITVerified email at mit.edu
