J. Shearer

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

dblp:49/4376 · DBLP profile ↗

← Back

1ranked-venue papers

0as first author

0since 2021 · last 1986

—ORCID · none

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

Systems, architecture and hardware · 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

Computational complexity · 50% Coding theory · 50%

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

Topic	Weight	Papers	Last	Evidence papers
Coding theory boolean functions	0.0	1	1986	Prime Implicants, Minimum Covers, and the Complexity of Logic Simplification · IEEE Trans. Computers 1986
Computational complexity boolean function complexity	0.0	1	1986	Prime Implicants, Minimum Covers, and the Complexity of Logic Simplification · IEEE Trans. Computers 1986

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

combinatorial analysis · 0.0

Year	Publication	Venue	Position
1986	Prime Implicants, Minimum Covers, and the Complexity of Logic Simplification abstract We show that any Boolean function f which can be expressed in a sum-of-products form using m product terms can contain as many as 2m− 1 implicants but no more. Curtis T. McMullen, J. Shearer	IEEE Trans. Computers	2