• Mozhengfu Liu and Xueyan Tang. 2024. Tight Bounds for Dynamic Bin Packing with Predictions. Proc. ACM Meas. Anal. Comput. Syst. 8, 3, Article 47 (December 2024), 28 pages.
• Mozhengfu Liu and Xueyan Tang. 2024. Brief Announcement: Tight bounds for Dynamic Bin Packing with Predictions. In Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '24). Association for Computing Machinery, New York, NY, USA, 297–299.
• Mozhengfu Liu and Xueyan Tang. 2024. Brief Announcement: Scheduling Jobs for Minimum Span: Improved Bounds and Learning-Augmented Algorithms. In Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '24). Association for Computing Machinery, New York, NY, USA, 141–143.
• Mozhengfu Liu and Xueyan Tang. 2022. Dynamic Bin Packing with Predictions[Abstract], Proc. ACM Meas. Anal. Comput. Syst. 6, 3, Article 45 (December 2022), 24 pages. In Abstract Proceedings of the 2023 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS '23). Association for Computing Machinery, New York, NY, USA, 57–58.
• Mozhengfu Liu and Xueyan Tang. 2022. Busy-Time Scheduling on Heterogeneous Machines: Algorithms and Analysis. IEEE Trans. Parallel Distrib. Syst. 33, 12 (Dec. 2022), 3942–3958.
• Mozhengfu Liu and Xueyan Tang. 2021. Analysis of Busy-Time Scheduling on Heterogeneous Machines[Presentation]. In Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '21). Association for Computing Machinery, New York, NY, USA, 340–350.