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

Vladislav Bubenik

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

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

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

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 88% Integrated circuit design · 12%

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

TopicWeightPapersLastEvidence papers
Electronic design automation
logic synthesis
0.011972
Weighting Method for the Determination of the Irredundant Set of Prime Implicants · IEEE Trans. Computers 1972
Electronic design automation › logic synthesis › two-level logic minimization
prime implicant selection
0.011972
Weighting Method for the Determination of the Irredundant Set of Prime Implicants · IEEE Trans. Computers 1972
Electronic design automation › logic synthesis › circuit optimization
circuit minimization
0.011972
Weighting Method for the Determination of the Irredundant Set of Prime Implicants · IEEE Trans. Computers 1972
Integrated circuit design
digital circuit design
0.011972
Weighting Method for the Determination of the Irredundant Set of Prime Implicants · IEEE Trans. Computers 1972

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

weighting method · 0.0irredundant cover · 0.0
YearPublicationVenuePosition
1972 Weighting Method for the Determination of the Irredundant Set of Prime Implicants
abstract
A complete or restricted set of prime implicants (PI's) can cover the terms of the switching function with more or less redundancy. In order to find an irredundant form from the set of PI's, it is necessary to choose those PI's which contribute most effectively towards the strict minimum sum. The criterion for the right choice of the PI's is their weight from the point of view of their cost and their ability to cover a maximum number of switching terms. This criterion assures the simplicity of the switching circuit and helps to increase its reliability. The PI's with the highest weight are chosen.
Vladislav Bubenik
IEEE Trans. Computers1