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

A. D. Raza

dblp:88/3449 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1986
—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
Interconnection networks and networks-on-chip · 100%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

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

TopicWeightPapersLastEvidence papers
Interconnection networks and networks-on-chip
network topology
0.011986
Reducing the Diameters of Computer Networks · IEEE Trans. Computers 1986
Graph algorithms and graph theory › graph theory › graph transformation › graph modification
graph augmentation
0.011986
Reducing the Diameters of Computer Networks · IEEE Trans. Computers 1986

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

graph theory · 0.0
YearPublicationVenuePosition
1986 Reducing the Diameters of Computer Networks
abstract
We discuss three methods of reducing the diameters of computer networks by adding additional processor to processor links under the constraint that no more than one I/O port be added to each processor. This is equivalent to adding edges to a given graph under the constraint that the degree of any node be increased, at most, by one.
Shahid H. Bokhari, A. D. Raza
IEEE Trans. Computers2