The following pages link to Sungjin Im (Q1709964):
Displaying 46 items.
- Minimizing the maximum flow time in batch scheduling (Q1709967) (← links)
- Energy efficient scheduling of parallelizable jobs (Q1743718) (← links)
- The matroid cup game (Q2060559) (← links)
- Preemptive and non-preemptive generalized min sum set cover (Q2248757) (← links)
- Non-clairvoyantly scheduling to minimize convex functions (Q2319644) (← links)
- Breaking \(1-1/e\) barrier for non-preemptive throughput maximization (Q2401168) (← links)
- The matroid intersection cover problem (Q2661583) (← links)
- Minimum Latency Submodular Cover (Q2843274) (← links)
- Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions (Q2851854) (← links)
- Preemptive and non-preemptive generalized min sum set cover (Q2904785) (← links)
- (Q2913807) (← links)
- (Q2955017) (← links)
- Coordination mechanisms from (almost) all scheduling policies (Q2988872) (← links)
- New Models and Algorithms for Throughput Maximization in Broadcast Scheduling (Q3075451) (← links)
- Competitive Algorithms from Competitive Equilibria (Q3177891) (← links)
- An online scalable algorithm for average flow time in broadcast scheduling (Q3189082) (← links)
- Fair Scheduling via Iterative Quasi-Uniform Sampling (Q3304734) (← links)
- On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs (Q3448775) (← links)
- Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities (Q3448831) (← links)
- Longest Wait First for Broadcast Scheduling [Extended Abstract] (Q3558913) (← links)
- Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling (Q3639266) (← links)
- Fair Scheduling via Iterative Quasi-Uniform Sampling (Q4575920) (← links)
- Competitive Analysis of Constrained Queueing Systems (Q4598286) (← links)
- Tight Bounds for Online Vector Scheduling (Q4620410) (← links)
- (Q4636440) (← links)
- Shortest-Elapsed-Time-First on a Multiprocessor (Q4916034) (← links)
- Efficient massively parallel methods for dynamic programming (Q4978024) (← links)
- (Q5092350) (← links)
- Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing (Q5111740) (← links)
- Breaking 1 - 1/e Barrier for Nonpreemptive Throughput Maximization (Q5130573) (← links)
- Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution (Q5146966) (← links)
- Hallucination Helps: Energy Efficient Virtual Circuit Routing (Q5210552) (← links)
- Online load balancing on related machines (Q5230274) (← links)
- Competitive algorithms from competitive equilibria (Q5259565) (← links)
- New Approximations for Broadcast Scheduling via Variants of α-point Rounding (Q5362999) (← links)
- A Dynamic Programming Framework for Non-Preemptive Scheduling Problems on Multiple Machines [Extended Abstract] (Q5363000) (← links)
- (Q5365024) (← links)
- (Q5365025) (← links)
- New Approximations for Reordering Buffer Management (Q5384043) (← links)
- Hallucination Helps: Energy Efficient Virtual Circuit Routing (Q5384046) (← links)
- (Q5417711) (← links)
- Online Scheduling with General Cost Functions (Q5419032) (← links)
- Energy Efficient Scheduling of Parallelizable Jobs (Q5741776) (← links)
- (Q5743473) (← links)
- (Q5743474) (← links)
- (Q6168414) (← links)
