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

Chamarty D. V. P. Rao

dblp:48/6857 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1983
—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
Processor architecture and microarchitecture · 56% Electronic design automation · 44%

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

TopicWeightPapersLastEvidence papers
Electronic design automation
logic synthesis		 0.011983
On the Minimization of Wordwidth in the Control Memory of a Microprogrammed Digital Computer · IEEE Trans. Computers 1983
Processor architecture and microarchitecture › microprogramming
microprogrammed control		 0.011983
On the Minimization of Wordwidth in the Control Memory of a Microprogrammed Digital Computer · IEEE Trans. Computers 1983
Processor architecture and microarchitecture
microprogramming		 0.011983
On the Minimization of Wordwidth in the Control Memory of a Microprogrammed Digital Computer · IEEE Trans. Computers 1983

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

maximal compatibility classes · 0.0grouping algorithm · 0.0
YearPublicationVenuePosition
1983 On the Minimization of Wordwidth in the Control Memory of a Microprogrammed Digital Computer
abstract
This paper describes a new method for reducing the wordwidth in the control memory of a microprogrammed digital computer. The method requires the computation of maximal compatibility classes (MCC's) of only a subset of subcommands unlike the existing methods in which MCCs of the entire set of subcommands are used. An algorithm has been given to obtain a near minimal solution by appropriate grouping of the MCC's. The necessary modification of the algorithm has also been presented to deal with large size microprograms.
Chamarty D. V. P. Rao, Nripendra N. Biswas
 IEEE Trans. Computers1