Seguir
Sungjin Im
Título
Citado por
Citado por
Ano
Fast clustering using MapReduce
A Ene, S Im, B Moseley
Proceedings of the 17th ACM SIGKDD international conference on Knowledge …, 2011
2662011
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
652017
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
602017
Secretary problems: Laminar matroid and interval scheduling
S Im, Y Wang
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
582011
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
522012
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
502014
A tutorial on amortized local competitiveness in online scheduling
S Im, B Moseley, K Pruhs
ACM SIGACT News 42 (2), 83-97, 2011
502011
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
422011
Energy efficient scheduling of parallelizable jobs
K Fox, S Im, B Moseley
Theoretical Computer Science 726, 30-40, 2018
362018
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
332015
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
332011
Online scheduling with general cost functions
S Im, B Moseley, K Pruhs
SIAM Journal on Computing 43 (1), 126-143, 2014
292014
Minimizing maximum response time and delay factor in broadcast scheduling
C Chekuri, S Im, B Moseley
European Symposium on Algorithms, 444-455, 2009
272009
Non-clairvoyant scheduling with predictions
S Im, R Kumar, M Montazer Qaem, M Purohit
Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and …, 2021
252021
Minimum latency submodular cover
S Im, V Nagarajan, RVD Zwaan
ACM Transactions on Algorithms (TALG) 13 (1), 1-28, 2016
252016
Preemptive and non-preemptive generalized min sum set cover
S Im, M Sviridenko, R Van Der Zwaan
Mathematical Programming 145 (1), 377-401, 2014
242014
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
242012
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
242010
Competitively scheduling tasks with intermediate parallelizability
S Im, B Moseley, K Pruhs, E Torng
ACM Transactions on Parallel Computing (TOPC) 3 (1), 1-19, 2016
232016
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
232012
O sistema não pode efectuar a operação agora. Tente mais tarde.
Artigos 1–20