Mozhengfu Liu

Orcid: 0000-0001-6181-9958

According to our database1, Mozhengfu Liu authored at least 6 papers between 2021 and 2025.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2025
Tight Bounds for Dynamic Bin Packing with Predictions.
Proceedings of the Abstracts of the 2025 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2025

2024
Brief Announcement: Tight bounds for Dynamic Bin Packing with Predictions.
Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

Brief Announcement: Scheduling Jobs for Minimum Span: Improved Bounds and Learning-Augmented Algorithms.
Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

2023
Dynamic Bin Packing with Predictions.
Proceedings of the Abstract Proceedings of the 2023 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2023

2022
Busy-Time Scheduling on Heterogeneous Machines: Algorithms and Analysis.
IEEE Trans. Parallel Distributed Syst., 2022

2021
Analysis of Busy-Time Scheduling on Heterogeneous Machines.
Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021


  Loading...