Sungjin Im

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6168414	2023-08-08	Paper
https://portal.mardi4nfdi.de/entity/Q5092350	2022-07-21	Paper
The matroid cup game	2021-12-13	Paper
The matroid intersection cover problem	2021-04-07	Paper
Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution	2021-02-02	Paper
Breaking 1 - 1/e Barrier for Nonpreemptive Throughput Maximization	2020-10-28	Paper
Fair Scheduling via Iterative Quasi-Uniform Sampling	2020-08-03	Paper
Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing	2020-05-27	Paper
Hallucination Helps: Energy Efficient Virtual Circuit Routing	2020-01-21	Paper
Online load balancing on related machines	2019-08-22	Paper
Non-clairvoyantly scheduling to minimize convex functions	2019-08-20	Paper
New Approximations for Reordering Buffer Management	2019-06-20	Paper
Hallucination Helps: Energy Efficient Virtual Circuit Routing	2019-06-20	Paper
Energy Efficient Scheduling of Parallelizable Jobs	2019-05-15	Paper
https://portal.mardi4nfdi.de/entity/Q5743473	2019-05-10	Paper
https://portal.mardi4nfdi.de/entity/Q5743474	2019-05-10	Paper
Tight Bounds for Online Vector Scheduling	2019-02-08	Paper
Minimizing the maximum flow time in batch scheduling	2019-01-15	Paper
Minimum Latency Submodular Cover	2018-11-05	Paper
Competitive Algorithms from Competitive Equilibria	2018-08-02	Paper
Fair Scheduling via Iterative Quasi-Uniform Sampling	2018-07-16	Paper
https://portal.mardi4nfdi.de/entity/Q4636440	2018-04-19	Paper
Energy efficient scheduling of parallelizable jobs	2018-04-16	Paper
Competitive Analysis of Constrained Queueing Systems	2017-12-19	Paper
New Approximations for Broadcast Scheduling via Variants of α-point Rounding	2017-10-05	Paper
A Dynamic Programming Framework for Non-Preemptive Scheduling Problems on Multiple Machines [Extended Abstract]	2017-10-05	Paper
https://portal.mardi4nfdi.de/entity/Q5365024	2017-09-29	Paper
https://portal.mardi4nfdi.de/entity/Q5365025	2017-09-29	Paper
Breaking \(1-1/e\) barrier for non-preemptive throughput maximization	2017-08-31	Paper
Efficient massively parallel methods for dynamic programming	2017-08-17	Paper
Coordination mechanisms from (almost) all scheduling policies	2017-05-19	Paper
https://portal.mardi4nfdi.de/entity/Q2955017	2017-01-24	Paper
On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs	2015-10-27	Paper
Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities	2015-10-27	Paper
Competitive algorithms from competitive equilibria	2015-06-26	Paper
An online scalable algorithm for average flow time in broadcast scheduling	2014-09-09	Paper
Preemptive and non-preemptive generalized min sum set cover	2014-06-27	Paper
Online Scheduling with General Cost Functions	2014-06-04	Paper
https://portal.mardi4nfdi.de/entity/Q5417711	2014-05-22	Paper
Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions	2013-10-04	Paper
Minimum Latency Submodular Cover	2013-08-12	Paper
Shortest-Elapsed-Time-First on a Multiprocessor	2013-04-19	Paper
https://portal.mardi4nfdi.de/entity/Q2913807	2012-09-27	Paper
Preemptive and non-preemptive generalized min sum set cover	2012-08-23	Paper
New Models and Algorithms for Throughput Maximization in Broadcast Scheduling	2011-02-15	Paper
Longest Wait First for Broadcast Scheduling [Extended Abstract]	2010-05-11	Paper
Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling	2009-10-29	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Sungjin Im