Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Rongheng Li

dblp:71/4055 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2013
0000-0003-2821-891XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 4 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 33% Parallel and multicore computing · 33% Embedded and real-time systems · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › task scheduling
online scheduling		 0.011998
An On-Line Algorithm for Some Uniform Processor Scheduling · SIAM J. Comput. 1998
Electronic design automation › high-level synthesis
scheduling		 0.011998
An On-Line Algorithm for Some Uniform Processor Scheduling · SIAM J. Comput. 1998
Embedded and real-time systems › real-time scheduling › multiprocessor scheduling
uniform processor scheduling		 0.011998
An On-Line Algorithm for Some Uniform Processor Scheduling · SIAM J. Comput. 1998

Methods — techniques the papers use, named apart from their topics

worst-case analysis · 0.0list scheduling · 0.0
YearPublicationVenuePosition
2013 Tight absolute bound for First Fit Decreasing bin-packing: FFD(l) ≤ 11/9 OPT(L) + 6/9
György Dósa, Rongheng Li, Zsolt Tuza
 Theor. Comput. Sci.2
2008 A General k-Level Uncapacitated Facility Location Problem
Rongheng Li, Huei Chuen Huang
 ICIC (3)1
2004 On the construction of most reliable networks
Hanyuan Deng, Jianer Chen, Qiaoliang Li, Rongheng Li, Qiju Gao
 Discret. Appl. Math.4
1998 An On-Line Algorithm for Some Uniform Processor Scheduling
abstract
This paper considers the problem of on-line scheduling a set of independent jobs on m uniform machines (M 1 , M 2 ,..., M m ) in which machine M i 's processing speed is s i =1 (i=1,..., m-1) and s m =s >1. List scheduling [Y. Cho and S. Sahni, SIAM J. Comput., 9 (1980), pp. 91--103] guarantees a worst-case performance of $\frac{3m-1}{m+1} (m\ge 3)$ and $\frac{1+\sqrt 5}2 (m=2)$ for this problem. We prove that this worst-case bound cannot be improved for m=2 and m=3 and for every $m\ge 4,$ an algorithm with worst-case performance at most $\frac{3m-1}{m+1}-\e$ is presented when s m =2,$ where e is a fixed positive number, and then we improve the bound for general s m =s > 1.
Rongheng Li, Lijie Shi
 SIAM J. Comput.1
1995 An On-Line Algorithm for Some Uniform Processor Scheduling
Rongheng Li, Lijie Shi
 COCOON1