Demo Data from VLDB 2026 / reviewers in the wild / expert
Ying-On Yan
dblp:91/6335
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2006
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 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.
| Theoretical computer science
1 paper |
Coding theory · 87% Computational complexity · 13% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory
source coding |
0.1 | 1 | 2006 | Zero-error instantaneous coding of correlated sources with length constraints is NP-complete · IEEE Trans. Inf. Theory 2006 |
Coding theory › channel coding
zero-error coding |
0.1 | 1 | 2006 | Zero-error instantaneous coding of correlated sources with length constraints is NP-complete · IEEE Trans. Inf. Theory 2006 |
Methods — techniques the papers use, named apart from their topics
reduction · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2006 | Zero-error instantaneous coding of correlated sources with length constraints is NP-completeabstractIt is well known that the Kraft inequality gives a necessary and sufficient condition on the codeword lengths of a zero-error instantaneous code for a single source. However, generalization for two correlated sources is nontrivial. We show that in the Slepian-Wolf configuration, even if one source is known at the decoder, designing a zero-error instantaneous code with given codeword lengths for the other source is NP-complete. Ying-On Yan, Toby Berger |
IEEE Trans. Inf. Theory | 1 |