Runtian Ren

Orcid: 0000-0002-8640-0421

According to our database1, Runtian Ren authored at least 12 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Modeling Online Paging in Multi-Core Systems.
CoRR, 2024

2023
Online Matching with Delays and Stochastic Arrival Times.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2021
The Min-Cost Matching with Concave Delays Problem.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Generalized Skyline Interval Coloring and Dynamic Geometric Bin Packing Problems.
Proceedings of the ICPP 2021: 50th International Conference on Parallel Processing, Lemont, IL, USA, August 9, 2021

2020
Interval Job Scheduling With Machine Launch Cost.
IEEE Trans. Parallel Distributed Syst., 2020

Busy-Time Scheduling on Heterogeneous Machines.
Proceedings of the 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2020

2019
Cloud Scheduling with Discrete Charging Units.
IEEE Trans. Parallel Distributed Syst., 2019

2018
Combinatorial algorithms for scheduling jobs to minimize server usage time
PhD thesis, 2018

2017
Competitiveness of Dynamic Bin Packing for Online Cloud Server Allocation.
IEEE/ACM Trans. Netw., 2017

Online Flexible Job Scheduling for Minimum Span.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

2016
Clairvoyant Dynamic Bin Packing for Job Scheduling with Minimum Server Usage Time.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

On First Fit Bin Packing for Online Cloud Server Allocation.
Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium, 2016


  Loading...