Sungjin Im

ORCID

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 81

Top Venues

Publications

Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii
Controlling Tail Risk in Online Ski-Rental. SODA (2024)
Sungjin Im, Ravi Kumar, Shi Li, Aditya Petety, Manish Purohit
Online Load and Graph Balancing for Random Order Inputs. CoRR (2024)
Aditya Bhaskara, Sreenivas Gollapudi, Sungjin Im, Kostas Kollias, Kamesh Munagala, Govind S. Sankar
Data Exchange Markets via Utility Balancing. CoRR (2024)
Sungjin Im, Benjamin Moseley, Hung Q. Ngo, Kirk Pruhs
On the Convergence Rate of Linear Datalog ^∘ over Stable Semirings. ICDT (2024)
Qingyun Chen, Sungjin Im, Benjamin Moseley, Chenyang Xu, Ruilong Zhang
Sampling for Beyond-Worst-Case Online Ranking. AAAI (2024)
Sungjin Im, Ravi Kumar, Shi Li, Aditya Petety, Manish Purohit
Online Load and Graph Balancing for Random Order Inputs. SPAA (2024)
Aditya Bhaskara, Sreenivas Gollapudi, Sungjin Im, Kostas Kollias, Kamesh Munagala, Govind S. Sankar
Data Exchange Markets via Utility Balancing. WWW (2024)
Sungjin Im, Shi Li
Improved Approximations for Unrelated Machine Scheduling. SODA (2023)
Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii
Controlling Tail Risk in Online Ski-Rental. CoRR (2023)
Sungjin Im, Ravi Kumar, Mahshid Montazer Qaem, Manish Purohit
Non-clairvoyant Scheduling with Predictions. ACM Trans. Parallel Comput. 10 (4) (2023)
Sungjin Im, Ravi Kumar, Silvio Lattanzi, Benjamin Moseley, Sergei Vassilvitskii
Massively Parallel Computation: Algorithms and Applications. Found. Trends Optim. 5 (4) (2023)
Qingyun Chen, Sungjin Im, Benjamin Moseley, Chenyang Xu, Ruilong Zhang
Min-Max Submodular Ranking for Multiple Agents. AAAI (2023)
Aditya Bhaskara, Sreenivas Gollapudi, Sungjin Im, Kostas Kollias, Kamesh Munagala
Online Learning and Bandits with Queried Hints. ITCS (2023)
Sungjin Im, Benjamin Moseley, Chenyang Xu, Ruilong Zhang
Online Dynamic Acknowledgement with Learned Predictions. INFOCOM (2023)
Sungjin Im, Benjamin Moseley, Chenyang Xu, Ruilong Zhang
Online Dynamic Acknowledgement with Learned Predictions. CoRR (2023)
Sungjin Im, Benjamin Moseley, Chenyang Xu, Ruilong Zhang
Online State Exploration: Competitive Worst Case and Learning-Augmented Algorithms. ECML/PKDD (4) (2023)
Sungjin Im, Benjamin Moseley, Hung Q. Ngo, Kirk Pruhs
Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs. CoRR (2023)
Sungjin Im, Benjamin Moseley, Hung Q. Ngo, Kirk Pruhs
On the Convergence Rate of Linear Datalogo over Stable Semirings. CoRR (2023)
Qingyun Chen, Sungjin Im, Benjamin Moseley, Chenyang Xu, Ruilong Zhang
Min-max Submodular Ranking for Multiple Agents. CoRR (2022)
Sungjin Im, Shi Li
Improved Approximations for Unrelated Machine Scheduling. CoRR (2022)
Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii
Algorithms with Prediction Portfolios. CoRR (2022)
Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii
Algorithms with Prediction Portfolios. NeurIPS (2022)
Sungjin Im, Benjamin Moseley, Hung Q. Ngo, Kirk Pruhs, Alireza Samadian
Optimizing Polymatroid Functions. CoRR (2022)
Aditya Bhaskara, Sreenivas Gollapudi, Sungjin Im, Kostas Kollias, Kamesh Munagala
Online Learning and Bandits with Queried Hints. CoRR (2022)
Sungjin Im, Ravi Kumar, Aditya Petety, Manish Purohit
Parsimonious Learning-Augmented Caching. ICML (2022)
Sungjin Im
Non-clairvoyant Scheduling with Predictions. ISAIM (2022)
Sungjin Im, Ravi Kumar, Aditya Petety, Manish Purohit
Parsimonious Learning-Augmented Caching. CoRR (2022)
Mahmoud Abo Khamis, Ryan R. Curtin, Sungjin Im, Benjamin Moseley, Hung Q. Ngo, Kirk Pruhs, Alireza Samadian
An Approximation Algorithm for the Matrix Tree Multiplication Problem. MFCS (2021)
Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii
Faster Matchings via Learned Duals. CoRR (2021)
Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii
Faster Matchings via Learned Duals. NeurIPS (2021)
Sungjin Im, Benjamin Moseley, Rudy Zhou
The Matroid Cup Game. Oper. Res. Lett. 49 (3) (2021)
Sungjin Im, Ravi Kumar, Mahshid Montazer Qaem, Manish Purohit
Non-Clairvoyant Scheduling with Predictions. SPAA (2021)
Sungjin Im, Benjamin Moseley, Kirk Pruhs
The matroid intersection cover problem. Oper. Res. Lett. 49 (1) (2021)
Mahmoud Abo Khamis, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian
Approximate Aggregate Queries Under Additive Inequalities. APOCS (2021)
Sungjin Im, Ravi Kumar, Mahshid Montazer Qaem, Manish Purohit
Online Knapsack with Frequency Predictions. NeurIPS (2021)
Mahmoud Abo Khamis, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian
A Relational Gradient Descent Algorithm For Support Vector Machine Training. APOCS (2021)
Mahmoud Abo Khamis, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian
Instance Optimal Join Size Estimation. LAGOS (2021)
Sungjin Im, Benjamin Moseley, Kamesh Munagala, Kirk Pruhs
Dynamic Weighted Fairness with Minimal Disruptions. CoRR (2020)
Sungjin Im, Benjamin Moseley, Kamesh Munagala, Kirk Pruhs
Dynamic Weighted Fairness with Minimal Disruptions. SIGMETRICS (Abstracts) (2020)
Mahmoud Abo Khamis, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian
A Relational Gradient Descent Algorithm For Support Vector Machine Training. CoRR (2020)
Sungjin Im, Benjamin Moseley
Fair Scheduling via Iterative Quasi-Uniform Sampling. SIAM J. Comput. 49 (3) (2020)
Mahmoud Abo Khamis, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian
Approximate Aggregate Queries Under Additive Inequalities. CoRR (2020)
Sungjin Im, Shi Li, Benjamin Moseley
Breaking 1 - 1/e Barrier for Nonpreemptive Throughput Maximization. SIAM J. Discret. Math. 34 (3) (2020)
Sungjin Im, Benjamin Moseley, Kamesh Munagala, Kirk Pruhs
Dynamic Weighted Fairness with Minimal Disruptions. Proc. ACM Meas. Anal. Comput. Syst. 4 (1) (2020)
Sungjin Im, Mahshid Montazer Qaem, Benjamin Moseley, Xiaorui Sun, Rudy Zhou
Fast Noise Removal for k-Means Clustering. AISTATS (2020)
Ilan Reuven Cohen, Sungjin Im, Debmalya Panigrahi
Online Two-Dimensional Load Balancing. ICALP (2020)
Sungjin Im, Mahshid Montazer Qaem, Benjamin Moseley, Xiaorui Sun, Rudy Zhou
Fast Noise Removal for k-Means Clustering. CoRR (2020)
Sungjin Im, Maryam Shadloo
Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution. CoRR (2020)
Sungjin Im, Maryam Shadloo
Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution. SODA (2020)
Mahmoud Abo Khamis, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian
Instance Optimal Join Size Estimation. CoRR (2020)
Alireza Samadian, Kirk Pruhs, Benjamin Moseley, Sungjin Im, Ryan R. Curtin
Unconditional Coresets for Regularized Loss Minimization. AISTATS (2020)
Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs, Clifford Stein
Hallucination Helps: Energy Efficient Virtual Circuit Routing. SIAM J. Comput. 49 (1) (2020)
Kyle Fox, Sungjin Im, Janardhan Kulkarni, Benjamin Moseley
Non-clairvoyantly Scheduling to Minimize Convex Functions. Algorithmica 81 (9) (2019)
Ryan R. Curtin, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian
On Coresets for Regularized Loss Minimization. CoRR (2019)
Sungjin Im, Benjamin Moseley, Kirk Pruhs, Manish Purohit
Matroid Coflow Scheduling. ICALP (2019)
Sungjin Im, Nathaniel Kell, Janardhan Kulkarni, Debmalya Panigrahi
Tight Bounds for Online Vector Scheduling. SIAM J. Comput. 48 (1) (2019)
Sungjin Im, Benjamin Moseley
A Conditional Lower Bound on Graph Connectivity in MapReduce. CoRR (2019)
Sungjin Im, Mahshid Montazer Qaem
Fast and Parallelizable Ranking with Outliers from Pairwise Comparisons. ECML/PKDD (1) (2019)
Sungjin Im, Nathaniel Kell, Debmalya Panigrahi, Maryam Shadloo
Online load balancing on related machines. STOC (2018)
Sungjin Im, Maryam Shadloo, Zizhan Zheng
Online Partial Throughput Maximization for Multidimensional Coflow. INFOCOM (2018)
Sungjin Im, Janardhan Kulkarni, Kamesh Munagala
Competitive Algorithms from Competitive Equilibria: Non-Clairvoyant Scheduling under Polyhedral Constraints. J. ACM 65 (1) (2018)
Kyle Fox, Sungjin Im, Benjamin Moseley
Energy efficient scheduling of parallelizable jobs. Theor. Comput. Sci. 726 (2018)
Sungjin Im, Benjamin Moseley, Kirk Pruhs, Clifford Stein
Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing. ESA (2017)
Sungjin Im, Benjamin Moseley
Fair Scheduling via Iterative Quasi-Uniform Sampling. SODA (2017)
Sungjin Im, Manish Purohit
A Tight Approximation for Co-flow Scheduling for Minimizing Total Weighted Completion Time. CoRR (2017)
Sungjin Im, Benjamin Moseley, Xiaorui Sun
Efficient massively parallel methods for dynamic programming. STOC (2017)
Sungjin Im, Benjamin Moseley, Kirk Pruhs, Clifford Stein
An O(Log Log m)-Competitive Algorithm for Online Machine Minimization. RTSS (2017)
Sungjin Im, Shi Li, Benjamin Moseley
Breaking 1 - 1/e Barrier for Non-preemptive Throughput Maximization. IPCO (2017)
Sungjin Im, Nathaniel Kell, Debmalya Panigrahi, Maryam Shadloo
Online Load Balancing for Related Machines. CoRR (2017)
Sungjin Im, Benjamin Moseley, Kirk Pruhs, Clifford Stein
An O(log log m)-competitive Algorithm for Online Machine Minimization. CoRR (2017)
Sungjin Im, Viswanath Nagarajan, Ruben van der Zwaan
Minimum Latency Submodular Cover. ACM Trans. Algorithms 13 (1) (2016)
Sungjin Im, Hoon Oh, Maryam Shadloo
Minimizing the maximum flow time in batch scheduling. Oper. Res. Lett. 44 (6) (2016)
Sungjin Im, Janardhan Kulkarni
Fair Online Scheduling for Selfish Jobs on Heterogeneous Machines. SPAA (2016)
Sungjin Im, Shi Li
Better Unrelated Machine Scheduling for Weighted Completion Time via Random Offsets from Non-Uniform Distributions. CoRR (2016)
Sungjin Im, Mina Naghshnejad, Mukesh Singhal
Scheduling jobs with non-uniform demands on multiple servers without interruption. INFOCOM (2016)
Sungjin Im, Shi Li
Better Unrelated Machine Scheduling for Weighted Completion Time via Random Offsets from Non-uniform Distributions. FOCS (2016)
Sungjin Im, Benjamin Moseley
General Profit Scheduling and the Power of Migration on Heterogeneous Machines. SPAA (2016)
Sungjin Im, Janardhan Kulkarni, Kamesh Munagala
Competitive Analysis of Constrained Queueing Systems. ICALP (2016)
Sungjin Im, Janardhan Kulkarni, Benjamin Moseley, Kamesh Munagala
A Competitive Flow Time Algorithm for Heterogeneous Clusters Under Polytope Constraints. APPROX-RANDOM (2016)
Sungjin Im, Maryam Shadloo
Brief Announcement: A QPTAS for Non-preemptive Speed-scaling. SPAA (2016)
Sungjin Im, Benjamin Moseley, Kirk Pruhs, Eric Torng
Competitively Scheduling Tasks with Intermediate Parallelizability. ACM Trans. Parallel Comput. 3 (1) (2016)
Sungjin Im, Shi Li, Benjamin Moseley, Eric Torng
A Dynamic Programming Framework for Non-Preemptive Scheduling Problems on Multiple Machines [Extended Abstract]. SODA (2015)
Sungjin Im, Janardhan Kulkarni, Benjamin Moseley
Temporal Fairness of Round Robin: Competitive Analysis for Lk-norms of Flow Time. SPAA (2015)
Sungjin Im, Benjamin Moseley
Scheduling in Bandwidth Constrained Tree Networks. SPAA (2015)
Sungjin Im, Nathaniel Kell, Janardhan Kulkarni, Debmalya Panigrahi
Tight Bounds for Online Vector Scheduling. FOCS (2015)
Sungjin Im, Benjamin Moseley
Brief Announcement: Fast and Better Distributed MapReduce Algorithms for k-Center Clustering. SPAA (2015)
Sungjin Im, Maxim Sviridenko
New Approximations for Broadcast Scheduling via Variants of α-point Rounding. SODA (2015)
Sungjin Im, Benjamin Moseley, Kirk Pruhs
Stochastic Scheduling of Heavy-tailed Jobs. STACS (2015)
Sungjin Im, Janardhan Kulkarni, Kamesh Munagala
Competitive Flow Time Algorithms for Polyhedral Scheduling. FOCS (2015)
Noa Avigdor-Elgrabli, Sungjin Im, Benjamin Moseley, Yuval Rabani
On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs. ICALP (1) (2015)
Sungjin Im, Benjamin Moseley
Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities. ICALP (1) (2015)
Sungjin Im, Janardhan Kulkarni, Kamesh Munagala, Kirk Pruhs
SELFISHMIGRATE: A Scalable Algorithm for Non-clairvoyantly Scheduling Heterogeneous Processors. CoRR (2014)
Sayan Bhattacharya, Sungjin Im, Janardhan Kulkarni, Kamesh Munagala
Coordination mechanisms from (almost) all scheduling policies. ITCS (2014)
Sungjin Im, Janardhan Kulkarni, Kamesh Munagala, Kirk Pruhs
SelfishMigrate: A Scalable Algorithm for Non-clairvoyantly Scheduling Heterogeneous Processors. FOCS (2014)
Sungjin Im, Janardhan Kulkarni, Kamesh Munagala
Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints. STOC (2014)
Sungjin Im, Janardhan Kulkarni, Kamesh Munagala
Competitive Algorithms from Competitive Equilibria: Non-Clairvoyant Scheduling under Polyhedral Constraints. CoRR (2014)
Sungjin Im, Nathaniel Kell, Janardhan Kulkarni, Debmalya Panigrahi
Tight Bounds for Online Vector Scheduling. CoRR (2014)
Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein
Hallucination Helps: Energy Efficient Virtual Circuit Routing. SODA (2014)
Sungjin Im, Benjamin Moseley
New Approximations for Reordering Buffer Management. SODA (2014)
Sungjin Im, Benjamin Moseley, Kirk Pruhs
Online Scheduling with General Cost Functions. SIAM J. Comput. 43 (1) (2014)

Sungjin Im.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Sungjin Im