Publications

• Gruia Calinescu, Mozhengfu Liu. Busy Time Minimization with Preemption, Migration, and One Resource Requirement.
  International Symposium on Algorithms and Computation (ISAAC), 2026. [full version]
• Mozhengfu Liu, Samir Khuller, Xueyan Tang. Online Span Minimization for Flexible Uniform Jobs.
  ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2026. [full version]
• Mozhengfu Liu, Xueyan Tang. Tight Bounds for Dynamic Bin Packing with Predictions.
  Proc. ACM on Measurement and Analysis of Computing Systems (POMACS), 2024. [SIGMETRICS '25 Abstract]
• Mozhengfu Liu, Xueyan Tang. Brief Announcement: Tight bounds for Dynamic Bin Packing with Predictions.
  ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2024.
• Mozhengfu Liu, Xueyan Tang. Brief Announcement: Scheduling Jobs for Minimum Span: Improved Bounds and Learning-Augmented Algorithms.
  ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2024.
• Mozhengfu Liu, Xueyan Tang. Dynamic Bin Packing with Predictions.
  Proc. ACM on Measurement and Analysis of Computing Systems (POMACS), 2022. [SIGMETRICS '23 Abstract]
• Mozhengfu Liu, Xueyan Tang. Busy-Time Scheduling on Heterogeneous Machines: Algorithms and Analysis.
  IEEE Transactions on Parallel and Distributed Systems (TPDS), 2022.
• Mozhengfu Liu, Xueyan Tang. Analysis of Busy-Time Scheduling on Heterogeneous Machines.
  ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2021. [Presentation]

Professional Service

• Shadow Committee Member
  ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2025, 2026