Sungjin Im

According to our database1, Sungjin Im authored at least 66 papers between 2009 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Dynamic Weighted Fairness with Minimal Disruptions.
CoRR, 2020

Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Tight Bounds for Online Vector Scheduling.
SIAM J. Comput., 2019

On Coresets for Regularized Loss Minimization.
CoRR, 2019

A Conditional Lower Bound on Graph Connectivity in MapReduce.
CoRR, 2019

Non-clairvoyantly Scheduling to Minimize Convex Functions.
Algorithmica, 2019

Matroid Coflow Scheduling.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Energy efficient scheduling of parallelizable jobs.
Theor. Comput. Sci., 2018

Competitive Algorithms from Competitive Equilibria: Non-Clairvoyant Scheduling under Polyhedral Constraints.
J. ACM, 2018

Online load balancing on related machines.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Online Partial Throughput Maximization for Multidimensional Coflow.
Proceedings of the 2018 IEEE Conference on Computer Communications, 2018

2017
A Tight Approximation for Co-flow Scheduling for Minimizing Total Weighted Completion Time.
CoRR, 2017

Efficient massively parallel methods for dynamic programming.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Fair Scheduling via Iterative Quasi-Uniform Sampling.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

An O(Log Log m)-Competitive Algorithm for Online Machine Minimization.
Proceedings of the 2017 IEEE Real-Time Systems Symposium, 2017

Breaking 1 - 1/e Barrier for Non-preemptive Throughput Maximization.
Proceedings of the Integer Programming and Combinatorial Optimization, 2017

Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016
Min-Sum Set Cover and Its Generalizations.
Encyclopedia of Algorithms, 2016

Competitively Scheduling Tasks with Intermediate Parallelizability.
TOPC, 2016

Minimum Latency Submodular Cover.
ACM Trans. Algorithms, 2016

Minimizing the maximum flow time in batch scheduling.
Oper. Res. Lett., 2016

Brief Announcement: A QPTAS for Non-preemptive Speed-scaling.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

General Profit Scheduling and the Power of Migration on Heterogeneous Machines.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Fair Online Scheduling for Selfish Jobs on Heterogeneous Machines.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Scheduling jobs with non-uniform demands on multiple servers without interruption.
Proceedings of the 35th Annual IEEE International Conference on Computer Communications, 2016

Competitive Analysis of Constrained Queueing Systems.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Better Unrelated Machine Scheduling for Weighted Completion Time via Random Offsets from Non-uniform Distributions.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

A Competitive Flow Time Algorithm for Heterogeneous Clusters Under Polytope Constraints.
Proceedings of the Approximation, 2016

2015
Stochastic Scheduling of Heavy-tailed Jobs.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Scheduling in Bandwidth Constrained Tree Networks.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Brief Announcement: Fast and Better Distributed MapReduce Algorithms for k-Center Clustering.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Temporal Fairness of Round Robin: Competitive Analysis for Lk-norms of Flow Time.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

New Approximations for Broadcast Scheduling via Variants of α-point Rounding.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

A Dynamic Programming Framework for Non-Preemptive Scheduling Problems on Multiple Machines [Extended Abstract].
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Competitive Flow Time Algorithms for Polyhedral Scheduling.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014
Online Scheduling with General Cost Functions.
SIAM J. Comput., 2014

Preemptive and non-preemptive generalized min sum set cover.
Math. Program., 2014

New Approximations for Reordering Buffer Management.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Hallucination Helps: Energy Efficient Virtual Circuit Routing.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Coordination mechanisms from (almost) all scheduling policies.
Proceedings of the Innovations in Theoretical Computer Science, 2014

SelfishMigrate: A Scalable Algorithm for Non-clairvoyantly Scheduling Heterogeneous Processors.
Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

2013
Optimizing Maximum Flow Time and Maximum Throughput in Broadcast Scheduling.
CoRR, 2013

Brief announcement: online batch scheduling for flow objectives.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Optimized scheduling of multi-IMA partitions with exclusive region for synchronized real-time multi-core systems.
Proceedings of the Design, Automation and Test in Europe, 2013

Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013

2012
Online Scheduling to Minimize Maximum Response Time and Maximum Delay Factor.
Theory of Computing, 2012

An online scalable algorithm for average flow time in broadcast scheduling.
ACM Trans. Algorithms, 2012

Speed scaling for stretch plus energy.
Oper. Res. Lett., 2012

Envy-Free Pricing with General Supply Constraints for Unit Demand Consumers.
J. Comput. Sci. Technol., 2012

Scheduling heterogeneous processors isn't as easy as you think.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Shortest-Elapsed-Time-First on a Multiprocessor.
Proceedings of the Design and Analysis of Algorithms, 2012

2011
A tutorial on amortized local competitiveness in online scheduling.
SIGACT News, 2011

Minimum Latency Submodular Cover in Metrics
CoRR, 2011

Secretary Problems: Laminar Matroid and Interval Scheduling.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Online Scalable Algorithm for Minimizing ℓk-norms of Weighted Flow Time On Unrelated Machines.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Online Scalable Scheduling for the ℓk-norms of Flow Time Without Conservation of Work.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Fast clustering using MapReduce.
Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2011

Signature Pattern Covering via Local Greedy Algorithm and Pattern Shrink.
Proceedings of the 11th IEEE International Conference on Data Mining, 2011

2010
Envy-Free Pricing with General Supply Constraints.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

New Models and Algorithms for Throughput Maximization in Broadcast Scheduling - (Extended Abstract).
Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010

Scheduling jobs with varying parallelizability to reduce variance.
Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

2009
Longest Wait First for Broadcast Scheduling
CoRR, 2009

Longest Wait First for Broadcast Scheduling [Extended Abstract].
Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling.
Proceedings of the Algorithms, 2009


  Loading...