Demo Data from SIGIR 2026 / reviewers in the wild / expert
Chia-Kai Su
dblp:217/8803
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1
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 networks
1 paper |
Internet of things and sensor networks · 33% Network performance modeling · 33% Routing and switching · 33% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Energy-efficient computing · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Routing and switching
maximum throughput |
0.3 | 1 | 2018 | Greenput: A Power-Saving Algorithm That Achieves Maximum Throughput in Wireless Networks · IEEE/ACM Trans. Netw. 2018 |
Internet of things and sensor networks › energy management
power management |
0.3 | 1 | 2018 | Greenput: A Power-Saving Algorithm That Achieves Maximum Throughput in Wireless Networks · IEEE/ACM Trans. Netw. 2018 |
Network performance modeling
throughput analysis |
0.3 | 1 | 2018 | Greenput: A Power-Saving Algorithm That Achieves Maximum Throughput in Wireless Networks · IEEE/ACM Trans. Netw. 2018 |
Energy-efficient computing › energy-efficient communication
energy efficiency in wireless networks |
0.1 | 1 | 2018 | Greenput: A Power-Saving Algorithm That Achieves Maximum Throughput in Wireless Networks · IEEE/ACM Trans. Netw. 2018 |
Methods — techniques the papers use, named apart from their topics
optimization · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2018 | Greenput: A Power-Saving Algorithm That Achieves Maximum Throughput in Wireless Networks
Cheng-Shang Chang, Duan-Shin Lee, Chia-Kai Su |
IEEE/ACM Trans. Netw. | 3 |