Demo Data from VLDB 2026 / reviewers in the wild / expert
Youzhi Yao
dblp:211/7880
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · unresolved
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.
| Theoretical computer science
1 paper |
Information theory · 75% Coding theory · 25% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information theory › network information theory › caching network
coded caching |
0.4 | 1 | 2019 | A Generalized Grouping Scheme in Coded Caching · IEEE Trans. Commun. 2019 |
Coding theory
network coding |
0.4 | 1 | 2019 | A Generalized Grouping Scheme in Coded Caching · IEEE Trans. Commun. 2019 |
Information theory › network information theory › caching network › coded caching
sub-packetization |
0.4 | 1 | 2019 | A Generalized Grouping Scheme in Coded Caching · IEEE Trans. Commun. 2019 |
Information theory
transmission rate |
0.4 | 1 | 2019 | A Generalized Grouping Scheme in Coded Caching · IEEE Trans. Commun. 2019 |
Methods — techniques the papers use, named apart from their topics
grouping method · 0.4concatenating construction · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | A Generalized Grouping Scheme in Coded CachingabstractCoded caching, which could significantly reduce the maximum amount of transmission rate during the peak traffic times in wireless network, has been widely studied recently. Apart from the transmission rate, sub-packetization F reflecting the implementation complexity, is also concerned in coded caching. The grouping method proposed by Shanmugam et al. is wellknown and widely used to reduce the sub-packetization level of the coded caching problem. In this paper, we propose a concatenating construction method for coded caching schemes, which generalizes the grouping method. Moreover, we demonstrate the advantage of our method in reducing the transmission rate over the grouping method. In particular, some new explicit schemes are obtained from previously known schemes. From one of these schemes, we can derive all the results by Tang and Ramamoorthy as special cases. Furthermore, the analysis and comparison of these new schemes are also performed. Minquan Cheng, Jing Jiang 0003, Qiang Wang 0012, Youzhi Yao |
IEEE Trans. Commun. | 4 |