Research
My CV.I am interested in algorithms, scheduling, large data analysis, online algorithms and algorithmic applications.
Notice: A paper below may not be the most recent version. Send me an e-mail if you are interested in an up to date copy. The copyright of the published papers below have been transferred to the respective publishers.
Unpublished Manuscripts:
-
Speed Scaling for Total Stretch Plus Energy
with: Daniel Cole, Sungjin Im and Kirk Pruhs
Manuscript
-
Bargaining on Trees
with: Arpita Ghosh, Satyen Kale, and Kevin Lang
Manuscript
-
Scheduling to Minimize Energy and Flow Time in Broadcast Scheduling
with:
Manuscript
Publications:
-
Scalable K-Means++
with: Bahman Bahmani, Andrea Vattani, Ravi Kumar and Sergei Vassilvitskii
International Conference on Very Large Data Bases (VLDB 2012)
-
Handling Forecast Errors while Bidding for Display Advertising
with: Kevin Lang and Sergei Vassilvitskii
International Conference on World Wide Web (WWW 2012)
-
Online Scheduling with General Cost Functions
with: Sungjin Im and Kirk Pruhs
ACM-SIAM Symposium on Discrete Algorithms (SODA 2012)
-
Scheduling Heterogeneous Processors Isn't As Easy As You Think
with: Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy and Kirk Pruhs
ACM-SIAM Symposium on Discrete Algorithms (SODA 2012)
- A Tutorial on Amortized Local Competitiveness in Online Scheduling
with: Sungjin Im and Kirk Pruhs
A tutorial on the popular potential function technique for online scheduling problems.
ACM SIGACT News (June 2011)
-
Fast Clustering using MapReduce
with: Alina Ene and Sungjin Im
ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD 2011) Oral Presentation.
-
Filtering: A Method for Solving Graph Problems in MapReduce
with: Silvio Lattanzi, Siddharth Suri and Sergei Vassilvitskii
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2011)
- On Scheduling in Map-Reduce and Flow-Shops
with: Anirban Dasgupta, Ravi Kumar and Tamas Sarlos
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2011)
-
Online Scheduling on Identical Machines using SRPT
with: Kyle Fox
ACM-SIAM Symposium on Discrete Algorithms (SODA 2011)
-
Online Scalable Scheduling for the \ell_k-norms of Flow Time Without Conservation of Work
with: Jeff Edmonds and Sungjin Im
ACM-SIAM Symposium on Discrete Algorithms (SODA 2011)
- An Online Scalable Algorithm for Minimizing \ell_k-norms of Weighted Flow Time on Unrelated Machines
with: Sungjin Im
ACM-SIAM Symposium on Discrete Algorithms (SODA 2011)
- New Models and Algorithms for Throughput Maximization in
Broadcast Scheduling
with: Chandra Chekuri, Avigdor Gal, Sungjin Im, Samir Khuller, Jian Li, Richard McCutchen and Louiqa Raschid
Workshop on Approximation and Online Algorithms (WAOA 2010)
- Scheduling Jobs with Varying Parallelizability to Reduce Variance
with: Anupam Gupta, Sungjin Im, Ravishankar Krishnaswamy and Kirk Pruhs
ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA 2010)
- An Online Scalable Algorithm for Average Flowtime in Broadcast Scheduling
with: Sungjin Im
Awarded Best Student Paper
ACM-SIAM Symposium on Discrete Algorithms (SODA 2010)
Journal Version: ACM Transactions on Algorithms
- Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling
with: Chandra Chekuri and Sungjin Im
17th Annual European Symposium on Algorithms (ESA 2009)
Journal Version (Combines the results of this paper and the SODA 2009 paper below):
Theory of Computing: Special Issue in honor of Rajeev Motwani
- Longest Wait First For Broadcast Scheduling
with: Chandra Chekuri and Sungjin Im
7th Workshop on Approximation and Online Algorithms (WAOA 2009)
- Online Scheduling to Minimize the Maximum Delay Factor
with: Chandra Chekuri
ACM-SIAM Symposium on Discrete Algorithms (SODA 2009)