| Fast clustering using MapReduce A Ene, S Im, B Moseley Proceedings of the 17th ACM SIGKDD international conference on Knowledge …, 2011 | 295 | 2011 |
| Competitive algorithms from competitive equilibria: Non-clairvoyant scheduling under polyhedral constraints S Im, J Kulkarni, K Munagala Journal of the ACM (JACM) 65 (1), 1-33, 2017 | 83 | 2017 |
| Efficient massively parallel methods for dynamic programming S Im, B Moseley, X Sun Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 69 | 2017 |
| Secretary problems: Laminar matroid and interval scheduling S Im, Y Wang Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011 | 68 | 2011 |
| Scheduling heterogeneous processors isn't as easy as you think A Gupta, S Im, R Krishnaswamy, B Moseley, K Pruhs Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012 | 60 | 2012 |
| Non-clairvoyant scheduling with predictions S Im, R Kumar, MM Qaem, M Purohit ACM Transactions on Parallel Computing 10 (4), 1-26, 2023 | 59 | 2023 |
| Selfishmigrate: A scalable algorithm for non-clairvoyantly scheduling heterogeneous processors S Im, J Kulkarni, K Munagala, K Pruhs 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 531-540, 2014 | 57 | 2014 |
| A tutorial on amortized local competitiveness in online scheduling S Im, B Moseley, K Pruhs ACM SIGACT News 42 (2), 83-97, 2011 | 52 | 2011 |
| Online knapsack with frequency predictions S Im, R Kumar, M Montazer Qaem, M Purohit Advances in neural information processing systems 34, 2733-2743, 2021 | 50 | 2021 |
| An Online Scalable Algorithm for Minimizing ℓk-norms of Weighted Flow Time on Unrelated Machines S Im, B Moseley Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete …, 2011 | 41 | 2011 |
| Energy efficient scheduling of parallelizable jobs K Fox, S Im, B Moseley Theoretical Computer Science 726, 30-40, 2018 | 39 | 2018 |
| Tight bounds for online vector scheduling S Im, N Kell, J Kulkarni, D Panigrahi 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 525-544, 2015 | 38 | 2015 |
| Minimum latency submodular cover S Im, V Nagarajan, RVD Zwaan ACM Transactions on Algorithms (TALG) 13 (1), 1-28, 2016 | 36 | 2016 |
| Online scheduling with general cost functions S Im, B Moseley, K Pruhs SIAM Journal on Computing 43 (1), 126-143, 2014 | 34 | 2014 |
| Fast noise removal for k-means clustering S Im, MM Qaem, B Moseley, X Sun, R Zhou International Conference on Artificial Intelligence and Statistics, 456-466, 2020 | 33 | 2020 |
| Preemptive and non-preemptive generalized min sum set cover S Im, M Sviridenko, R Van Der Zwaan Mathematical Programming 145 (1), 377-401, 2014 | 32 | 2014 |
| Online Scalable Scheduling for the ℓk-norms of Flow Time Without Conservation of Work J Edmonds, S Im, B Moseley Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete …, 2011 | 32 | 2011 |
| Coordination mechanisms from (almost) all scheduling policies S Bhattacharya, S Im, J Kulkarni, K Munagala Proceedings of the 5th conference on Innovations in theoretical computer …, 2014 | 31 | 2014 |
| Minimizing maximum response time and delay factor in broadcast scheduling C Chekuri, S Im, B Moseley Algorithms-ESA 2009: 17th Annual European Symposium, Copenhagen, Denmark …, 2009 | 30 | 2009 |
| Parsimonious learning-augmented caching S Im, R Kumar, A Petety, M Purohit International Conference on Machine Learning, 9588-9601, 2022 | 29 | 2022 |
