Demo Data from VLDB 2026 / reviewers in the wild / expert
Tadaaki Itoh
dblp:294/0656
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1995
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 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 |
Coding theory · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › source coding › universal coding
competitive optimality |
0.0 | 1 | 1995 | Competitive optimality of source codes · IEEE Trans. Inf. Theory 1995 |
Coding theory › source coding › variable-length codes › prefix codes
huffman coding |
0.0 | 1 | 1995 | Competitive optimality of source codes · IEEE Trans. Inf. Theory 1995 |
Coding theory
source coding |
0.0 | 1 | 1995 | Competitive optimality of source codes · IEEE Trans. Inf. Theory 1995 |
Methods — techniques the papers use, named apart from their topics
competitive analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1995 | Competitive optimality of source codesabstractCompetitively optimal coding is considered and the following is proved. (1) If the competitively optimal code exists for a given source probability p(x), then it also attains the minimum expected codeword length. (2) If the Huffman code tree for p(x) is unbalanced in probability weight, then the competitively optimal code does not exist. Furthermore, the relation between competitively optimal coding and game theory is considered. Hirosuke Yamamoto, Tadaaki Itoh |
IEEE Trans. Inf. Theory | 2 |