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

James E. Bartow

dblp:134/0039 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1963
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 2 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
2 papers
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory
error-correcting codes		 0.021963
An upper bound on the error correction ability of codes (Corresp.) · IEEE Trans. Inf. Theory 1963
A reduced upper bound on the error correction ability of codes (Corresp.) · IEEE Trans. Inf. Theory 1963
Coding theory › error-correcting codes › coding bounds
error correction bounds		 0.021963
An upper bound on the error correction ability of codes (Corresp.) · IEEE Trans. Inf. Theory 1963
A reduced upper bound on the error correction ability of codes (Corresp.) · IEEE Trans. Inf. Theory 1963
YearPublicationVenuePosition
1963 A reduced upper bound on the error correction ability of codes (Corresp.)
James E. Bartow
 IEEE Trans. Inf. Theory1
1963 An upper bound on the error correction ability of codes (Corresp.)
James E. Bartow
 IEEE Trans. Inf. Theory1