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

Pierre L. Tison

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

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

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

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Electronic design automation · 82% Integrated circuit design · 18%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › logic synthesis › logic minimization
boolean function minimization		 0.011967
Generalization of Consensus Theory and Application to the Minimization of Boolean Functions · IEEE Trans. Electron. Comput. 1967
Electronic design automation
logic synthesis		 0.011967
Generalization of Consensus Theory and Application to the Minimization of Boolean Functions · IEEE Trans. Electron. Comput. 1967
Electronic design automation › logic synthesis › two-level logic minimization
prime implicant		 0.011967
Generalization of Consensus Theory and Application to the Minimization of Boolean Functions · IEEE Trans. Electron. Comput. 1967
Integrated circuit design › digital circuit design
switching circuits		 0.011971
An Algebra for Logic Systems - Switching Circuits Application · IEEE Trans. Computers 1971

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

boolean algebra · 0.0
YearPublicationVenuePosition
1971 An Algebra for Logic Systems - Switching Circuits Application
abstract
The goal of this note is to present a new logical variable, the "degree of freedom," which is more refined than the usual Boolean variable, and also the very general algebra which may be formulated using the concept of "degree of freedom."
Pierre L. Tison
 IEEE Trans. Computers1
1967 Generalization of Consensus Theory and Application to the Minimization of Boolean Functions
abstract
Given two implicants of a Boolean function, we can, by performing their consensus, find a third implicant. This operation has been used for finding the prime implicants of a Boolean function. In this paper, the consensus is extended from two to any number of terms. A property of these generalized consensus relations leads to a systematic way of finding them. It is shown that any prime implicant of a Boolean function is a generalized consensus; therefore the algorithm for the determination of the consensus relations can be used for finding the prime implicants. This new method is simpler than the usual process of iterative consensus. It is also shown in this paper that consensus theory can be used for finding the minimal sums of a Boolean function. The methods are applicable for any Boolean function, with or without don't care conditions, with a single or a multiple output.
Pierre L. Tison
 IEEE Trans. Electron. Comput.1