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

Melvin H. McKinney

dblp:30/1646 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1977
—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%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › logic synthesis › logic minimization
boolean function minimization		 0.011977
A New Technique for the Fast Minimization of Switching Functions · IEEE Trans. Computers 1977
Electronic design automation
logic synthesis		 0.011977
A New Technique for the Fast Minimization of Switching Functions · IEEE Trans. Computers 1977

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

directed-search algorithm · 0.0
YearPublicationVenuePosition
1977 A New Technique for the Fast Minimization of Switching Functions
abstract
The minimization of switching functions involving many variables is a difficult task. This paper presents a new minimization procedure that allows this process to be implemented with reduced computational effort. This procedure, designated as the directed-search algorithm, is applicable to both manual and computer-programmed minimization. The details of the algorithm are presented and illustrated by example. Comparative run-times between another minimization program and the directed-search algorithm, as implemented in Fortran, are also given.
V. Thomas Rhyne, Philip S. Noe, Melvin H. McKinney, Udo W. Pooch
 IEEE Trans. Computers3