Fast clustering using MapReduce A Ene, S Im, B Moseley Proceedings of the 17th ACM SIGKDD international conference on Knowledge …, 2011 | 244 | 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 | 52 | 2017 |

Secretary problems: Laminar matroid and interval scheduling S Im, Y Wang Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011 | 49 | 2011 |

A tutorial on amortized local competitiveness in online scheduling S Im, B Moseley, K Pruhs ACM SIGACT News 42 (2), 83-97, 2011 | 48 | 2011 |

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 | 47 | 2017 |

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 | 46 | 2012 |

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 | 43 | 2014 |

An Online Scalable Algorithm for Minimizing ℓ_{k}-norms of Weighted Flow Time on Unrelated MachinesS Im, B Moseley Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete …, 2011 | 37 | 2011 |

Energy efficient scheduling of parallelizable jobs K Fox, S Im, B Moseley Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013 | 31 | 2013 |

Online scheduling with general cost functions S Im, B Moseley, K Pruhs SIAM Journal on Computing 43 (1), 126-143, 2014 | 29 | 2014 |

Online Scalable Scheduling for the ℓ_{k}-norms of Flow Time Without Conservation of WorkJ Edmonds, S Im, B Moseley Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete …, 2011 | 29 | 2011 |

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 | 26 | 2015 |

An online scalable algorithm for average flow time in broadcast scheduling S Im, B Moseley ACM Transactions on Algorithms (TALG) 8 (4), 1-17, 2012 | 24 | 2012 |

Minimizing maximum response time and delay factor in broadcast scheduling C Chekuri, S Im, B Moseley European Symposium on Algorithms, 444-455, 2009 | 24 | 2009 |

Online scheduling to minimize maximum response time and maximum delay factor C Chekuri, S Im, B Moseley Theory of Computing 8 (1), 165-195, 2012 | 23 | 2012 |

Scheduling jobs with varying parallelizability to reduce variance A Gupta, S Im, R Krishnaswamy, B Moseley, K Pruhs Proceedings of the twenty-second annual ACM symposium on Parallelism in …, 2010 | 22 | 2010 |

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 | 20 | 2014 |

Fast and better distributed mapreduce algorithms for k-center clustering S Im, B Moseley Proceedings of the 27th ACM symposium on Parallelism in Algorithms and …, 2015 | 18 | 2015 |

A dynamic programming framework for non-preemptive scheduling problems on multiple machines S Im, S Li, B Moseley, E Torng Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014 | 18 | 2014 |

Preemptive and non-preemptive generalized min sum set cover S Im, M Sviridenko, R Van Der Zwaan Mathematical Programming 145 (1), 377-401, 2014 | 18 | 2014 |