Sungjin Im

From MaRDI portal
Person:1709964

Available identifiers

zbMath Open im.sungjinMaRDI QIDQ1709964

List of research outcomes





PublicationDate of PublicationType
Controlling tail risk in online ski-rental2024-11-28Paper
Online learning and bandits with queried hints2024-09-25Paper
Improved approximations for unrelated machine scheduling2024-05-14Paper
https://portal.mardi4nfdi.de/entity/Q61684142023-08-08Paper
https://portal.mardi4nfdi.de/entity/Q50923502022-07-21Paper
The matroid cup game2021-12-13Paper
The matroid intersection cover problem2021-04-07Paper
Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution2021-02-02Paper
Breaking 1 - 1/e Barrier for Nonpreemptive Throughput Maximization2020-10-28Paper
Fair Scheduling via Iterative Quasi-Uniform Sampling2020-08-03Paper
Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing2020-05-27Paper
Hallucination Helps: Energy Efficient Virtual Circuit Routing2020-01-21Paper
Online load balancing on related machines2019-08-22Paper
Non-clairvoyantly scheduling to minimize convex functions2019-08-20Paper
Hallucination Helps: Energy Efficient Virtual Circuit Routing2019-06-20Paper
New Approximations for Reordering Buffer Management2019-06-20Paper
Energy Efficient Scheduling of Parallelizable Jobs2019-05-15Paper
https://portal.mardi4nfdi.de/entity/Q57434742019-05-10Paper
https://portal.mardi4nfdi.de/entity/Q57434732019-05-10Paper
Tight Bounds for Online Vector Scheduling2019-02-08Paper
Minimizing the maximum flow time in batch scheduling2019-01-15Paper
Minimum Latency Submodular Cover2018-11-05Paper
Competitive Algorithms from Competitive Equilibria2018-08-02Paper
Fair Scheduling via Iterative Quasi-Uniform Sampling2018-07-16Paper
https://portal.mardi4nfdi.de/entity/Q46364402018-04-19Paper
Energy efficient scheduling of parallelizable jobs2018-04-16Paper
Competitive Analysis of Constrained Queueing Systems2017-12-19Paper
New Approximations for Broadcast Scheduling via Variants of α-point Rounding2017-10-05Paper
A Dynamic Programming Framework for Non-Preemptive Scheduling Problems on Multiple Machines [Extended Abstract]2017-10-05Paper
https://portal.mardi4nfdi.de/entity/Q53650242017-09-29Paper
https://portal.mardi4nfdi.de/entity/Q53650252017-09-29Paper
Breaking \(1-1/e\) barrier for non-preemptive throughput maximization2017-08-31Paper
Efficient massively parallel methods for dynamic programming2017-08-17Paper
Coordination mechanisms from (almost) all scheduling policies2017-05-19Paper
https://portal.mardi4nfdi.de/entity/Q29550172017-01-24Paper
On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs2015-10-27Paper
Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities2015-10-27Paper
Competitive algorithms from competitive equilibria2015-06-26Paper
An online scalable algorithm for average flow time in broadcast scheduling2014-09-09Paper
Preemptive and non-preemptive generalized min sum set cover2014-06-27Paper
Online Scheduling with General Cost Functions2014-06-04Paper
https://portal.mardi4nfdi.de/entity/Q54177112014-05-22Paper
Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions2013-10-04Paper
Minimum Latency Submodular Cover2013-08-12Paper
Shortest-Elapsed-Time-First on a Multiprocessor2013-04-19Paper
Online scheduling to minimize maximum response time and maximum delay factor2012-09-27Paper
Preemptive and non-preemptive generalized min sum set cover2012-08-23Paper
Speed scaling for stretch plus energy2012-08-17Paper
New Models and Algorithms for Throughput Maximization in Broadcast Scheduling2011-02-15Paper
Longest Wait First for Broadcast Scheduling [Extended Abstract]2010-05-11Paper
Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling2009-10-29Paper

Research outcomes over time

This page was built for person: Sungjin Im