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

Kyung Shik Koh

dblp:178/3954 · DBLP profile ↗
← Back
2ranked-venue papers
2as 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 · 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
1 paper
Electronic design automation · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › logic synthesis
boolean function realization
0.011971
A Minimization Technique for Tant Networks · IEEE Trans. Computers 1971
Electronic design automation
logic synthesis
0.011971
A Minimization Technique for Tant Networks · IEEE Trans. Computers 1971
Electronic design automation › logic synthesis › multilevel logic synthesis
TANT network minimization
0.011971
A Minimization Technique for Tant Networks · IEEE Trans. Computers 1971

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

minimal gate realization · 0.0
YearPublicationVenuePosition
1972 Author's Reply
Kyung Shik Koh
IEEE Trans. Computers1
1971 A Minimization Technique for Tant Networks
abstract
A TANT network is a three-level network composed solely of AND-NOT gates having only uncomplemented inputs. A method of minimal gate TANT realization of a Boolean function is presented. The procedure permits hand solution of four-and five-variable problems. A computer program will be required to handle more complex cases.
Kyung Shik Koh
IEEE Trans. Computers1