Følg
Sungjin Im
Titel
Citeret af
Citeret af
År
Fast clustering using MapReduce
A Ene, S Im, B Moseley
Proceedings of the 17th ACM SIGKDD international conference on Knowledge …, 2011
2912011
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
742017
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
692017
Secretary problems: Laminar matroid and interval scheduling
S Im, Y Wang
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
642011
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
572012
Non-clairvoyant scheduling with predictions
S Im, R Kumar, MM Qaem, M Purohit
ACM Transactions on Parallel Computing 10 (4), 1-26, 2023
522023
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
522014
A tutorial on amortized local competitiveness in online scheduling
S Im, B Moseley, K Pruhs
ACM SIGACT News 42 (2), 83-97, 2011
492011
Online knapsack with frequency predictions
S Im, R Kumar, M Montazer Qaem, M Purohit
Advances in Neural Information Processing Systems 34, 2733-2743, 2021
392021
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
392011
Energy efficient scheduling of parallelizable jobs
K Fox, S Im, B Moseley
Theoretical Computer Science 726, 30-40, 2018
382018
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
372015
Minimum latency submodular cover
S Im, V Nagarajan, RVD Zwaan
ACM Transactions on Algorithms (TALG) 13 (1), 1-28, 2016
342016
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
322011
Preemptive and non-preemptive generalized min sum set cover
S Im, M Sviridenko, R Van Der Zwaan
Mathematical Programming 145 (1), 377-401, 2014
312014
Online scheduling with general cost functions
S Im, B Moseley, K Pruhs
SIAM Journal on Computing 43 (1), 126-143, 2014
312014
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
302009
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
282014
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
272020
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
252012
Systemet kan ikke foretage handlingen nu. Prøv igen senere.
Artikler 1–20