| 2013 | ||
|---|---|---|
| c18 | Jung-Eun Kim, Man-Ki Yoon, Sungjin Im, Richard M. Bradford, Lui Sha: Optimized scheduling of multi-IMA partitions with exclusive region for synchronized real-time multi-core systems. DATE 2013: 970-975 | |
| c17 | Kyle Fox, Sungjin Im, Benjamin Moseley: Energy Efficient Scheduling of Parallelizable Jobs. SODA 2013: 948-957 | |
| 2012 | ||
| j5 | Sungjin Im, Pinyan Lu, Yayun Wang: Envy-Free Pricing with General Supply Constraints for Unit Demand Consumers. J. Comput. Sci. Technol. 27(4): 702-709 (2012) | |
| j4 | Daniel Cole, Sungjin Im, Benjamin Moseley, Kirk Pruhs: Speed scaling for stretch plus energy. Oper. Res. Lett. 40(3): 180-184 (2012) | |
| j3 | Sungjin Im, Benjamin Moseley: An online scalable algorithm for average flow time in broadcast scheduling. ACM Transactions on Algorithms 8(4): 39 (2012) | |
| j2 | Chandra Chekuri, Sungjin Im, Benjamin Moseley: Online Scheduling to Minimize Maximum Response Time and Maximum Delay Factor. Theory of Computing 8(1): 165-195 (2012) | |
| c16 | Sungjin Im, Viswanath Nagarajan, Ruben van der Zwaan: Minimum Latency Submodular Cover. ICALP (1) 2012: 485-497 | |
| c15 | Neal Barcelo, Sungjin Im, Benjamin Moseley, Kirk Pruhs: Shortest-Elapsed-Time-First on a Multiprocessor. MedAlg 2012: 82-92 | |
| c14 | Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs: Scheduling heterogeneous processors isn't as easy as you think. SODA 2012: 1242-1253 | |
| c13 | Sungjin Im, Benjamin Moseley, Kirk Pruhs: Online scheduling with general cost functions. SODA 2012: 1254-1265 | |
| c12 | Sungjin Im, Maxim Sviridenko, Ruben van der Zwaan: Preemptive and Non-Preemptive Generalized Min Sum Set Cover. STACS 2012: 465-476 | |
| 2011 | ||
| j1 | Sungjin Im, Benjamin Moseley, Kirk Pruhs: A tutorial on amortized local competitiveness in online scheduling. SIGACT News 42(2): 83-97 (2011) | |
| c11 | Hyungsul Kim, Sungjin Im, Tarek F. Abdelzaher, Jiawei Han, David Sheridan, Shobha Vasudevan: Signature Pattern Covering via Local Greedy Algorithm and Pattern Shrink. ICDM 2011: 330-339 | |
| c10 | ||
| c9 | Sungjin Im, Benjamin Moseley: Online Scalable Algorithm for Minimizing ℓk-norms of Weighted Flow Time On Unrelated Machines. SODA 2011: 95-108 | |
| c8 | Jeff Edmonds, Sungjin Im, Benjamin Moseley: Online Scalable Scheduling for the ℓk-norms of Flow Time Without Conservation of Work. SODA 2011: 109-119 | |
| c7 | Sungjin Im, Yajun Wang: Secretary Problems: Laminar Matroid and Interval Scheduling. SODA 2011: 1265-1274 | |
| i4 | ||
| i3 | Sungjin Im, Viswanath Nagarajan: Minimum Latency Submodular Cover in Metrics. CoRR abs/1110.2207 (2011) | |
| 2010 | ||
| c6 | Sungjin Im, Benjamin Moseley: An Online Scalable Algorithm for Average Flow Time in Broadcast Scheduling. SODA 2010: 1322-1333 | |
| c5 | Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs: Scheduling jobs with varying parallelizability to reduce variance. SPAA 2010: 11-20 | |
| c4 | Chandra Chekuri, Avigdor Gal, Sungjin Im, Samir Khuller, Jian Li, Richard Matthew McCutchen, Benjamin Moseley, Louiqa Raschid: New Models and Algorithms for Throughput Maximization in Broadcast Scheduling - (Extended Abstract). WAOA 2010: 71-82 | |
| c3 | Sungjin Im, Pinyan Lu, Yajun Wang: Envy-Free Pricing with General Supply Constraints. WINE 2010: 483-491 | |
| 2009 | ||
| c2 | Chandra Chekuri, Sungjin Im, Benjamin Moseley: Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling. ESA 2009: 444-455 | |
| c1 | Chandra Chekuri, Sungjin Im, Benjamin Moseley: Longest Wait First for Broadcast Scheduling [Extended Abstract]. WAOA 2009: 62-74 | |
| i2 | Chandra Chekuri, Sungjin Im, Benjamin Moseley: Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling. CoRR abs/0906.2048 (2009) | |
| i1 | Chandra Chekuri, Sungjin Im, Benjamin Moseley: Longest Wait First for Broadcast Scheduling. CoRR abs/0906.2395 (2009) | |
Colors in the list of coauthors
Last update Mon May 20 07:05:11 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page