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

Parveen K. Gupta

dblp:177/1241 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1973
—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 · 67% Integrated circuit design · 33%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › logic synthesis › finite state machine synthesis
incompletely specified sequential machine
0.011973
Fast State Minimization of Incompletely Specified Sequential Machines · IEEE Trans. Computers 1973
Integrated circuit design › digital circuit design
sequential circuit design
0.011973
Fast State Minimization of Incompletely Specified Sequential Machines · IEEE Trans. Computers 1973
Electronic design automation › logic synthesis › logic optimization
state minimization
0.011973
Fast State Minimization of Incompletely Specified Sequential Machines · IEEE Trans. Computers 1973

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

state cover computation · 0.0
YearPublicationVenuePosition
1973 Fast State Minimization of Incompletely Specified Sequential Machines
abstract
Existing techniques for finding minimum state covers of an incompletely specified sequential machine are streamlined to yield a single minimum cover with significantly less computation. The factor by which computation is reduced is directly proportional to the complexity of the machine.
Parveen K. Gupta, Donald L. Dietmeyer
IEEE Trans. Computers1