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 VLDB 2026 / reviewers in the wild / expert

D. G. Mead

dblp:22/5065 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1982
—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
1 paper
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures › search algorithms
combinatorial search		 0.011979
The average number of weighings to locate a counterfeit coin (Corresp.) · IEEE Trans. Inf. Theory 1979
Algorithms and data structures › search algorithms › combinatorial search
counterfeit coin problem		 0.011979
The average number of weighings to locate a counterfeit coin (Corresp.) · IEEE Trans. Inf. Theory 1979
Algorithms and data structures › search algorithms › combinatorial search
optimal strategies		 0.011979
The average number of weighings to locate a counterfeit coin (Corresp.) · IEEE Trans. Inf. Theory 1979

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

average-case analysis · 0.0
YearPublicationVenuePosition
1982 Comment on 'An improved strategy for a counterfeit coin problem' by Winkelmann, K
D. G. Mead
 IEEE Trans. Inf. Theory1
1979 The average number of weighings to locate a counterfeit coin (Corresp.)
abstract
A solution is obtained to the problem of finding the minimum of the average number of weighings, using a balance, needed to locate one light coin from amongncoins of whichn - 1are genuine and of the same weight. Optimal strategies are determined, and the anomaly that it may be better to work withn + 1coins rather thannis examined and explained.
D. G. Mead
 IEEE Trans. Inf. Theory1