default search action
Sungjin Im
Person information
- affiliation: University of California at Merced, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c77]Qingyun Chen, Sungjin Im, Benjamin Moseley, Chenyang Xu, Ruilong Zhang:
Sampling for Beyond-Worst-Case Online Ranking. AAAI 2024: 20649-20656 - [c76]Sungjin Im, Benjamin Moseley, Hung Q. Ngo, Kirk Pruhs:
On the Convergence Rate of Linear Datalog ^∘ over Stable Semirings. ICDT 2024: 11:1-11:20 - [c75]Michael Dinitz, Sungjin Im, Thomas Lavastida
, Benjamin Moseley, Sergei Vassilvitskii:
Controlling Tail Risk in Online Ski-Rental. SODA 2024: 4247-4263 - [c74]Sungjin Im
Online Load and Graph Balancing for Random Order Inputs. SPAA 2024: 491-497 - [c73]Aditya Bhaskara
Data Exchange Markets via Utility Balancing. WWW 2024: 57-65 - [i35]Aditya Bhaskara, Sreenivas Gollapudi, Sungjin Im, Kostas Kollias, Kamesh Munagala, Govind S. Sankar:
Data Exchange Markets via Utility Balancing. CoRR abs/2401.13053 (2024) - [i34]Sungjin Im, Ravi Kumar, Shi Li, Aditya Petety, Manish Purohit:
Online Load and Graph Balancing for Random Order Inputs. CoRR abs/2405.07949 (2024) - [i33]Qingyun Chen, Sungjin Im, Aditya Petety:
Online Scheduling via Gradient Descent for Weighted Flow Time Minimization. CoRR abs/2409.03020 (2024) - [i32]Qingyun Chen, Nick Gravin, Sungjin Im:
Strategic Facility Location via Predictions. CoRR abs/2410.07497 (2024) - 2023
- [j22]Sungjin Im, Ravi Kumar, Silvio Lattanzi, Benjamin Moseley, Sergei Vassilvitskii:
Massively Parallel Computation: Algorithms and Applications. Found. Trends Optim. 5(4): 340-417 (2023) - [j21]Sungjin Im
Non-clairvoyant Scheduling with Predictions. ACM Trans. Parallel Comput. 10(4): 19:1-19:26 (2023) - [c72]Qingyun Chen, Sungjin Im, Benjamin Moseley, Chenyang Xu, Ruilong Zhang:
Min-Max Submodular Ranking for Multiple Agents. AAAI 2023: 7061-7068 - [c71]Sungjin Im, Benjamin Moseley, Chenyang Xu, Ruilong Zhang:
Online Dynamic Acknowledgement with Learned Predictions. INFOCOM 2023: 1-10 - [c70]Aditya Bhaskara, Sreenivas Gollapudi, Sungjin Im, Kostas Kollias, Kamesh Munagala
Online Learning and Bandits with Queried Hints. ITCS 2023: 16:1-16:24 - [c69]Sungjin Im, Benjamin Moseley, Chenyang Xu, Ruilong Zhang:
Online State Exploration: Competitive Worst Case and Learning-Augmented Algorithms. ECML/PKDD (4) 2023: 333-348 - [c68]Sungjin Im, Shi Li:
Improved Approximations for Unrelated Machine Scheduling. SODA 2023: 2917-2946 - [i31]Sungjin Im, Benjamin Moseley, Chenyang Xu, Ruilong Zhang:
Online Dynamic Acknowledgement with Learned Predictions. CoRR abs/2305.18227 (2023) - [i30]Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii:
Controlling Tail Risk in Online Ski-Rental. CoRR abs/2308.05067 (2023) - [i29]Sungjin Im, Benjamin Moseley, Hung Q. Ngo, Kirk Pruhs:
On the Convergence Rate of Linear Datalogo over Stable Semirings. CoRR abs/2311.17664 (2023) - [i28]Sungjin Im, Benjamin Moseley, Hung Q. Ngo, Kirk Pruhs:
Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs. CoRR abs/2312.14063 (2023) - 2022
- [c67]Sungjin Im, Ravi Kumar, Aditya Petety, Manish Purohit:
Parsimonious Learning-Augmented Caching. ICML 2022: 9588-9601 - [c66]Sungjin Im:
Non-clairvoyant Scheduling with Predictions. ISAIM 2022 - [c65]Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii:
Algorithms with Prediction Portfolios. NeurIPS 2022 - [i27]Sungjin Im, Ravi Kumar, Aditya Petety, Manish Purohit:
Parsimonious Learning-Augmented Caching. CoRR abs/2202.04262 (2022) - [i26]Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii:
Algorithms with Prediction Portfolios. CoRR abs/2210.12438 (2022) - [i25]Aditya Bhaskara, Sreenivas Gollapudi, Sungjin Im, Kostas Kollias, Kamesh Munagala:
Online Learning and Bandits with Queried Hints. CoRR abs/2211.02703 (2022) - [i24]Sungjin Im, Benjamin Moseley, Hung Q. Ngo, Kirk Pruhs, Alireza Samadian:
Optimizing Polymatroid Functions. CoRR abs/2211.08381 (2022) - [i23]Sungjin Im, Shi Li:
Improved Approximations for Unrelated Machine Scheduling. CoRR abs/2211.10398 (2022) - [i22]Qingyun Chen, Sungjin Im, Benjamin Moseley, Chenyang Xu, Ruilong Zhang:
Min-max Submodular Ranking for Multiple Agents. CoRR abs/2212.07682 (2022) - 2021
- [j20]Sungjin Im, Benjamin Moseley, Kirk Pruhs
The matroid intersection cover problem. Oper. Res. Lett. 49(1): 17-22 (2021) - [j19]Sungjin Im, Benjamin Moseley, Rudy Zhou
The Matroid Cup Game. Oper. Res. Lett. 49(3): 405-411 (2021) - [c64]Mahmoud Abo Khamis
Approximate Aggregate Queries Under Additive Inequalities. APOCS 2021: 85-99 - [c63]Mahmoud Abo Khamis
A Relational Gradient Descent Algorithm For Support Vector Machine Training. APOCS 2021: 100-113 - [c62]Mahmoud Abo Khamis, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian:
Instance Optimal Join Size Estimation. LAGOS 2021: 135-144 - [c61]Mahmoud Abo Khamis
An Approximation Algorithm for the Matrix Tree Multiplication Problem. MFCS 2021: 6:1-6:14 - [c60]Sungjin Im, Ravi Kumar, Mahshid Montazer Qaem, Manish Purohit:
Online Knapsack with Frequency Predictions. NeurIPS 2021: 2733-2743 - [c59]Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii:
Faster Matchings via Learned Duals. NeurIPS 2021: 10393-10406 - [c58]Sungjin Im, Ravi Kumar, Mahshid Montazer Qaem, Manish Purohit:
Non-Clairvoyant Scheduling with Predictions. SPAA 2021: 285-294 - [i21]Michael Dinitz, Sungjin Im, Thomas Lavastida, Benjamin Moseley, Sergei Vassilvitskii:
Faster Matchings via Learned Duals. CoRR abs/2107.09770 (2021) - 2020
- [j18]Sungjin Im, Benjamin Moseley, Kamesh Munagala, Kirk Pruhs:
Dynamic Weighted Fairness with Minimal Disruptions. Proc. ACM Meas. Anal. Comput. Syst. 4(1): 19:1-19:18 (2020) - [j17]Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan
Hallucination Helps: Energy Efficient Virtual Circuit Routing. SIAM J. Comput. 49(1): 37-66 (2020) - [j16]Sungjin Im, Benjamin Moseley:
Fair Scheduling via Iterative Quasi-Uniform Sampling. SIAM J. Comput. 49(3): 658-680 (2020) - [j15]Sungjin Im, Shi Li
Breaking 1 - 1/e Barrier for Nonpreemptive Throughput Maximization. SIAM J. Discret. Math. 34(3): 1649-1669 (2020) - [c57]Sungjin Im, Mahshid Montazer Qaem, Benjamin Moseley, Xiaorui Sun, Rudy Zhou:
Fast Noise Removal for k-Means Clustering. AISTATS 2020: 456-466 - [c56]Alireza Samadian, Kirk Pruhs, Benjamin Moseley, Sungjin Im, Ryan R. Curtin:
Unconditional Coresets for Regularized Loss Minimization. AISTATS 2020: 482-492 - [c55]Ilan Reuven Cohen, Sungjin Im, Debmalya Panigrahi:
Online Two-Dimensional Load Balancing. ICALP 2020: 34:1-34:21 - [c54]Sungjin Im, Benjamin Moseley, Kamesh Munagala, Kirk Pruhs:
Dynamic Weighted Fairness with Minimal Disruptions. SIGMETRICS (Abstracts) 2020: 5-6 - [c53]Sungjin Im, Maryam Shadloo:
Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution. SODA 2020: 2790-2809 - [i20]Sungjin Im, Maryam Shadloo:
Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution. CoRR abs/2001.05015 (2020) - [i19]Sungjin Im, Benjamin Moseley, Kamesh Munagala, Kirk Pruhs:
Dynamic Weighted Fairness with Minimal Disruptions. CoRR abs/2001.06841 (2020) - [i18]Sungjin Im, Mahshid Montazer Qaem, Benjamin Moseley, Xiaorui Sun, Rudy Zhou:
Fast Noise Removal for k-Means Clustering. CoRR abs/2003.02433 (2020) - [i17]Mahmoud Abo Khamis, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian:
Approximate Aggregate Queries Under Additive Inequalities. CoRR abs/2003.10588 (2020) - [i16]Mahmoud Abo Khamis, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian:
A Relational Gradient Descent Algorithm For Support Vector Machine Training. CoRR abs/2005.05325 (2020) - [i15]Mahmoud Abo Khamis, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian:
Instance Optimal Join Size Estimation. CoRR abs/2012.08083 (2020)
2010 – 2019
- 2019
- [j14]Kyle Fox, Sungjin Im, Janardhan Kulkarni, Benjamin Moseley:
Non-clairvoyantly Scheduling to Minimize Convex Functions. Algorithmica 81(9): 3746-3764 (2019) - [j13]Sungjin Im, Nathaniel Kell, Janardhan Kulkarni, Debmalya Panigrahi:
Tight Bounds for Online Vector Scheduling. SIAM J. Comput. 48(1): 93-121 (2019) - [c52]Sungjin Im, Benjamin Moseley, Kirk Pruhs, Manish Purohit:
Matroid Coflow Scheduling. ICALP 2019: 145:1-145:14 - [c51]Sungjin Im, Mahshid Montazer Qaem:
Fast and Parallelizable Ranking with Outliers from Pairwise Comparisons. ECML/PKDD (1) 2019: 173-188 - [i14]Sungjin Im, Benjamin Moseley:
A Conditional Lower Bound on Graph Connectivity in MapReduce. CoRR abs/1904.08954 (2019) - [i13]Ryan R. Curtin, Sungjin Im, Benjamin Moseley, Kirk Pruhs, Alireza Samadian:
On Coresets for Regularized Loss Minimization. CoRR abs/1905.10845 (2019) - 2018
- [j12]Sungjin Im, Janardhan Kulkarni, Kamesh Munagala:
Competitive Algorithms from Competitive Equilibria: Non-Clairvoyant Scheduling under Polyhedral Constraints. J. ACM 65(1): 3:1-3:33 (2018) - [j11]Kyle Fox, Sungjin Im, Benjamin Moseley:
Energy efficient scheduling of parallelizable jobs. Theor. Comput. Sci. 726: 30-40 (2018) - [c50]Sungjin Im, Maryam Shadloo, Zizhan Zheng:
Online Partial Throughput Maximization for Multidimensional Coflow. INFOCOM 2018: 2042-2050 - [c49]Sungjin Im, Nathaniel Kell, Debmalya Panigrahi, Maryam Shadloo:
Online load balancing on related machines. STOC 2018: 30-43 - 2017
- [c48]Sungjin Im, Benjamin Moseley, Kirk Pruhs, Clifford Stein:
Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing. ESA 2017: 51:1-51:10 - [c47]Sungjin Im, Shi Li, Benjamin Moseley:
Breaking 1 - 1/e Barrier for Non-preemptive Throughput Maximization. IPCO 2017: 292-304 - [c46]Sungjin Im, Benjamin Moseley, Kirk Pruhs, Clifford Stein:
An O(Log Log m)-Competitive Algorithm for Online Machine Minimization. RTSS 2017: 343-350 - [c45]Sungjin Im, Benjamin Moseley:
Fair Scheduling via Iterative Quasi-Uniform Sampling. SODA 2017: 2601-2615 - [c44]Sungjin Im, Benjamin Moseley, Xiaorui Sun:
Efficient massively parallel methods for dynamic programming. STOC 2017: 798-811 - [i12]Sungjin Im, Manish Purohit:
A Tight Approximation for Co-flow Scheduling for Minimizing Total Weighted Completion Time. CoRR abs/1707.04331 (2017) - [i11]Sungjin Im, Benjamin Moseley, Kirk Pruhs, Clifford Stein:
An O(log log m)-competitive Algorithm for Online Machine Minimization. CoRR abs/1708.09046 (2017) - [i10]Sungjin Im, Nathaniel Kell, Debmalya Panigrahi, Maryam Shadloo:
Online Load Balancing for Related Machines. CoRR abs/1709.10455 (2017) - 2016
- [j10]Sungjin Im, Hoon Oh, Maryam Shadloo:
Minimizing the maximum flow time in batch scheduling. Oper. Res. Lett. 44(6): 784-789 (2016) - [j9]Sungjin Im, Viswanath Nagarajan, Ruben van der Zwaan:
Minimum Latency Submodular Cover. ACM Trans. Algorithms 13(1): 13:1-13:28 (2016) - [j8]Sungjin Im, Benjamin Moseley, Kirk Pruhs, Eric Torng:
Competitively Scheduling Tasks with Intermediate Parallelizability. ACM Trans. Parallel Comput. 3(1): 4:1-4:19 (2016) - [c43]Sungjin Im, Janardhan Kulkarni, Benjamin Moseley, Kamesh Munagala:
A Competitive Flow Time Algorithm for Heterogeneous Clusters Under Polytope Constraints. APPROX-RANDOM 2016: 10:1-10:15 - [c42]Sungjin Im, Shi Li:
Better Unrelated Machine Scheduling for Weighted Completion Time via Random Offsets from Non-uniform Distributions. FOCS 2016: 138-147 - [c41]Sungjin Im, Janardhan Kulkarni, Kamesh Munagala:
Competitive Analysis of Constrained Queueing Systems. ICALP 2016: 143:1-143:13 - [c40]Sungjin Im, Mina Naghshnejad
Scheduling jobs with non-uniform demands on multiple servers without interruption. INFOCOM 2016: 1-9 - [c39]Sungjin Im, Benjamin Moseley:
General Profit Scheduling and the Power of Migration on Heterogeneous Machines. SPAA 2016: 165-173 - [c38]Sungjin Im, Janardhan Kulkarni:
Fair Online Scheduling for Selfish Jobs on Heterogeneous Machines. SPAA 2016: 185-194 - [c37]Sungjin Im, Maryam Shadloo:
Brief Announcement: A QPTAS for Non-preemptive Speed-scaling. SPAA 2016: 207-209 - [r1]Sungjin Im:
Min-Sum Set Cover and Its Generalizations. Encyclopedia of Algorithms 2016: 1331-1334 - [i9]Sungjin Im, Shi Li:
Better Unrelated Machine Scheduling for Weighted Completion Time via Random Offsets from Non-Uniform Distributions. CoRR abs/1606.08817 (2016) - 2015
- [c36]Sungjin Im, Janardhan Kulkarni, Kamesh Munagala
Competitive Flow Time Algorithms for Polyhedral Scheduling. FOCS 2015: 506-524 - [c35]Sungjin Im, Nathaniel Kell, Janardhan Kulkarni, Debmalya Panigrahi:
Tight Bounds for Online Vector Scheduling. FOCS 2015: 525-544 - [c34]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: 78-90 - [c33]Sungjin Im, Benjamin Moseley:
Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities. ICALP (1) 2015: 737-748 - [c32]Sungjin Im, Maxim Sviridenko:
New Approximations for Broadcast Scheduling via Variants of α-point Rounding. SODA 2015: 1050-1069 - [c31]Sungjin Im, Shi Li, Benjamin Moseley, Eric Torng:
A Dynamic Programming Framework for Non-Preemptive Scheduling Problems on Multiple Machines [Extended Abstract]. SODA 2015: 1070-1086 - [c30]Sungjin Im, Benjamin Moseley:
Brief Announcement: Fast and Better Distributed MapReduce Algorithms for k-Center Clustering. SPAA 2015: 65-67 - [c29]Sungjin Im, Janardhan Kulkarni, Benjamin Moseley:
Temporal Fairness of Round Robin: Competitive Analysis for Lk-norms of Flow Time. SPAA 2015: 155-160 - [c28]Sungjin Im, Benjamin Moseley:
Scheduling in Bandwidth Constrained Tree Networks. SPAA 2015: 171-180 - [c27]Sungjin Im, Benjamin Moseley, Kirk Pruhs:
Stochastic Scheduling of Heavy-tailed Jobs. STACS 2015: 474-486 - 2014
- [j7]Sungjin Im, Maxim Sviridenko, Ruben van der Zwaan:
Preemptive and non-preemptive generalized min sum set cover. Math. Program. 145(1-2): 377-401 (2014) - [j6]Sungjin Im, Benjamin Moseley, Kirk Pruhs:
Online Scheduling with General Cost Functions. SIAM J. Comput. 43(1): 126-143 (2014) - [c26]Sungjin Im, Janardhan Kulkarni, Kamesh Munagala, Kirk Pruhs:
SelfishMigrate: A Scalable Algorithm for Non-clairvoyantly Scheduling Heterogeneous Processors. FOCS 2014: 531-540 - [c25]Sayan Bhattacharya, Sungjin Im, Janardhan Kulkarni, Kamesh Munagala:
Coordination mechanisms from (almost) all scheduling policies. ITCS 2014: 121-134 - [c24]Sungjin Im, Benjamin Moseley:
New Approximations for Reordering Buffer Management. SODA 2014: 1093-1111 - [c23]Antonios Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs, Cliff Stein:
Hallucination Helps: Energy Efficient Virtual Circuit Routing. SODA 2014: 1141-1153 - [c22]Sungjin Im, Benjamin Moseley, Kirk Pruhs, Eric Torng:
Competitively scheduling tasks with intermediate parallelizability. SPAA 2014: 22-29 - [c21]Sungjin Im, Janardhan Kulkarni, Kamesh Munagala:
Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints. STOC 2014: 313-322 - [i8]Sungjin Im, Janardhan Kulkarni, Kamesh Munagala:
Competitive Algorithms from Competitive Equilibria: Non-Clairvoyant Scheduling under Polyhedral Constraints. CoRR abs/1404.1097 (2014) - [i7]Sungjin Im, Janardhan Kulkarni, Kamesh Munagala, Kirk Pruhs:
SELFISHMIGRATE: A Scalable Algorithm for Non-clairvoyantly Scheduling Heterogeneous Processors. CoRR abs/1404.1943 (2014) - [i6]Sungjin Im, Nathaniel Kell, Janardhan Kulkarni, Debmalya Panigrahi:
Tight Bounds for Online Vector Scheduling. CoRR abs/1411.3887 (2014) - 2013
- [c20]Kyle Fox, Sungjin Im, Janardhan Kulkarni, Benjamin Moseley:
Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions. APPROX-RANDOM 2013: 142-157 - [c19]Jung-Eun Kim, Man-Ki Yoon, Sungjin Im, Richard M. Bradford, Lui Sha:
Optimized scheduling of multi-IMA partitions with exclusive region for synchronized real-time multi-core systems. DATE 2013: 970-975 - [c18]Kyle Fox, Sungjin Im, Benjamin Moseley:
Energy Efficient Scheduling of Parallelizable Jobs. SODA 2013: 948-957 - [c17]Sungjin Im, Benjamin Moseley:
Brief announcement: online batch scheduling for flow objectives. SPAA 2013: 102-104 - [i5]Sungjin Im, Maxim Sviridenko:
Optimizing Maximum Flow Time and Maximum Throughput in Broadcast Scheduling. CoRR abs/1309.3675 (2013) - 2012
- [b1]Sungjin Im:
Online scheduling algorithms for average flow time and its variants. University of Illinois Urbana-Champaign, USA, 2012 - [j5]Sungjin Im, Pinyan Lu
Envy-Free Pricing with General Supply Constraints for Unit Demand Consumers. J. Comput. Sci. Technol. 27(4): 702-709 (2012) - [j4]Daniel Cole, Sungjin Im, Benjamin Moseley, Kirk Pruhs:
Speed scaling for stretch plus energy. Oper. Res. Lett. 40(3): 180-184 (2012) - [j3]Sungjin Im, Benjamin Moseley:
An online scalable algorithm for average flow time in broadcast scheduling. ACM Trans. Algorithms 8(4): 39:1-39:17 (2012) - [j2]Chandra Chekuri, Sungjin Im, Benjamin Moseley:
Online Scheduling to Minimize Maximum Response Time and Maximum Delay Factor. Theory Comput. 8(1): 165-195 (2012) - [c16]Sungjin Im, Viswanath Nagarajan, Ruben van der Zwaan:
Minimum Latency Submodular Cover. ICALP (1) 2012: 485-497 - [c15]Neal Barcelo, Sungjin Im, Benjamin Moseley, Kirk Pruhs:
Shortest-Elapsed-Time-First on a Multiprocessor. MedAlg 2012: 82-92 - [c14]Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs:
Scheduling heterogeneous processors isn't as easy as you think. SODA 2012: 1242-1253 - [c13]Sungjin Im, Benjamin Moseley, Kirk Pruhs:
Online scheduling with general cost functions. SODA 2012: 1254-1265 - [c12]Sungjin Im, Maxim Sviridenko, Ruben van der Zwaan:
Preemptive and Non-Preemptive Generalized Min Sum Set Cover. STACS 2012: 465-476 - 2011
- [j1]Sungjin Im, Benjamin Moseley, Kirk Pruhs:
A tutorial on amortized local competitiveness in online scheduling. SIGACT News 42(2): 83-97 (2011) - [c11]Hyungsul Kim, Sungjin Im, Tarek F. Abdelzaher, Jiawei Han, David Sheridan, Shobha Vasudevan:
Signature Pattern Covering via Local Greedy Algorithm and Pattern Shrink. ICDM 2011: 330-339 - [c10]Alina Ene, Sungjin Im, Benjamin Moseley:
Fast clustering using MapReduce. KDD 2011: 681-689 - [c9]Sungjin Im, Benjamin Moseley:
Online Scalable Algorithm for Minimizing ℓk-norms of Weighted Flow Time On Unrelated Machines. SODA 2011: 95-108 - [c8]Jeff Edmonds, Sungjin Im, Benjamin Moseley:
Online Scalable Scheduling for the ℓk-norms of Flow Time Without Conservation of Work. SODA 2011: 109-119 - [c7]Sungjin Im, Yajun Wang:
Secretary Problems: Laminar Matroid and Interval Scheduling. SODA 2011: 1265-1274 - [i4]Alina Ene, Sungjin Im, Benjamin Moseley:
Fast Clustering using MapReduce. CoRR abs/1109.1579 (2011) - [i3]Sungjin Im, Viswanath Nagarajan:
Minimum Latency Submodular Cover in Metrics. CoRR abs/1110.2207 (2011) - 2010
- [c6]Sungjin Im, Benjamin Moseley:
An Online Scalable Algorithm for Average Flow Time in Broadcast Scheduling. SODA 2010: 1322-1333 - [c5]Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Kirk Pruhs:
Scheduling jobs with varying parallelizability to reduce variance. SPAA 2010: 11-20 - [c4]Chandra Chekuri, Avigdor Gal, Sungjin Im, Samir Khuller, Jian Li, Richard Matthew McCutchen
New Models and Algorithms for Throughput Maximization in Broadcast Scheduling - (Extended Abstract). WAOA 2010: 71-82 - [c3]Sungjin Im, Pinyan Lu
Envy-Free Pricing with General Supply Constraints. WINE 2010: 483-491
2000 – 2009
- 2009
- [c2]Chandra Chekuri, Sungjin Im, Benjamin Moseley:
Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling. ESA 2009: 444-455 - [c1]Chandra Chekuri, Sungjin Im, Benjamin Moseley:
Longest Wait First for Broadcast Scheduling [Extended Abstract]. WAOA 2009: 62-74 - [i2]Chandra Chekuri, Sungjin Im, Benjamin Moseley:
Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling. CoRR abs/0906.2048 (2009) - [i1]Chandra Chekuri, Sungjin Im, Benjamin Moseley:
Longest Wait First for Broadcast Scheduling. CoRR abs/0906.2395 (2009)
Coauthor Index
[c77] [c76] [c75] [j22] [c72] [c71] [c69] [i31] [i30] [i29] [i28] [c65] [i26] [i24] [i22] [j20] [j19] [c64] [c63] [c62] [c61] [c59] [i21] [j18] [j17] [j16] [j15] [c57] [c56] [c54] [i19] [i18] [i17] [i16] [i15] [j14] [c52] [i14] [i13] [j11] [c48] [c47] [c46] [c45] [c44] [i11] [j8] [c43] [c39] [c34] [c33] [c31] [c30] [c29] [c28] [c27] [j6] [c24] [c23] [c22] [c20] [c18] [c17] [j4] [j3] [j2] [c15] [c14] [c13] [j1] [c10] [c9] [c8] [i4] [c6] [c5] [c4] [c2] [c1] [i2] [i1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-19 20:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: