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

Yoji Niho

dblp:134/8307 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1973
—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 · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › uniquely decodable codes
comma-free codes		 0.011973
On maximal comma-free codes (Corresp.) · IEEE Trans. Inf. Theory 1973

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

combinatorial search · 0.0
YearPublicationVenuePosition
1973 On maximal comma-free codes (Corresp.)
abstract
In this correspondence a binary maximal comma-free code for words of length 10 and the search technique used to construct it are described.
Yoji Niho
 IEEE Trans. Inf. Theory1