default search action
Runtian Ren
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c9]Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski:
Multi-level Aggregation with Delays and Stochastic Arrivals. AAMAS 2024: 2378-2380 - [c8]Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski:
Online Multi-Level Aggregation with Delays and Stochastic Arrivals. ISAAC 2024: 49:1-49:20 - [i4]Mathieu Mari, Anish Mukherjee, Runtian Ren, Piotr Sankowski:
Modeling Online Paging in Multi-Core Systems. CoRR abs/2401.05834 (2024) - [i3]Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski:
Online Multi-level Aggregation with Delays and Stochastic Arrivals. CoRR abs/2404.09711 (2024) - 2023
- [c7]Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski:
Online Matching with Delays and Stochastic Arrival Times. AAMAS 2023: 976-984 - 2022
- [i2]Mathieu Mari, Michal Pawlowski, Runtian Ren, Piotr Sankowski:
Online matching with delays and stochastic arrival times. CoRR abs/2210.07018 (2022) - 2021
- [c6]Runtian Ren, Xueyan Tang:
Generalized Skyline Interval Coloring and Dynamic Geometric Bin Packing Problems. ICPP 2021: 52:1-52:10 - [c5]Yossi Azar, Runtian Ren, Danny Vainstein:
The Min-Cost Matching with Concave Delays Problem. SODA 2021: 301-320 - 2020
- [j3]Runtian Ren
, Yuqing Zhu, Chuanyou Li, Xueyan Tang
Interval Job Scheduling With Machine Launch Cost. IEEE Trans. Parallel Distributed Syst. 31(12): 2776-2788 (2020) - [c4]Runtian Ren, Xueyan Tang:
Busy-Time Scheduling on Heterogeneous Machines. IPDPS 2020: 306-315 - [i1]Yossi Azar, Runtian Ren, Danny Vainstein:
The Min-Cost Matching with Concave Delays Problem. CoRR abs/2011.02017 (2020)
2010 – 2019
- 2019
- [j2]Ming Ming Tan
Cloud Scheduling with Discrete Charging Units. IEEE Trans. Parallel Distributed Syst. 30(7): 1541-1551 (2019) - 2018
- [b1]Runtian Ren:
Combinatorial algorithms for scheduling jobs to minimize server usage time. Nanyang Technological University, Singapore, 2018 - 2017
- [j1]Runtian Ren, Xueyan Tang
Competitiveness of Dynamic Bin Packing for Online Cloud Server Allocation. IEEE/ACM Trans. Netw. 25(3): 1324-1331 (2017) - [c3]Runtian Ren, Xueyan Tang:
Online Flexible Job Scheduling for Minimum Span. SPAA 2017: 55-66 - 2016
- [c2]Xueyan Tang, Yusen Li, Runtian Ren, Wentong Cai
On First Fit Bin Packing for Online Cloud Server Allocation. IPDPS 2016: 323-332 - [c1]Runtian Ren, Xueyan Tang:
Clairvoyant Dynamic Bin Packing for Job Scheduling with Minimum Server Usage Time. SPAA 2016: 227-237
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-05 20:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: