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

S. Suraratrungsi

dblp:173/1796 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1974
—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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation
logic synthesis
0.011974
Comments on "Weighting Method for the Determination of the Irredundant Set of Prime Implicants" · IEEE Trans. Computers 1974
Electronic design automation › logic synthesis › two-level logic minimization
prime implicant selection
0.011974
Comments on "Weighting Method for the Determination of the Irredundant Set of Prime Implicants" · IEEE Trans. Computers 1974
Mathematical optimization › discrete optimization
boolean function minimization
0.011974
Comments on "Weighting Method for the Determination of the Irredundant Set of Prime Implicants" · IEEE Trans. Computers 1974

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

weighting method · 0.0
YearPublicationVenuePosition
1974 Comments on "Weighting Method for the Determination of the Irredundant Set of Prime Implicants"
abstract
By contradictory example, the method proposed by Bubenik for selecting "an irredundant set of prime implicants" is shown to lack generality.
Philip S. Noe, V. Thomas Rhyne, S. Suraratrungsi
IEEE Trans. Computers3