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

P. D. Joshi

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

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

TopicWeightPapersLastEvidence papers
Distributed systems › peer-to-peer systems
network construction
0.011991
A Synthesis Approach to Design Optimally Fault Tolerant Network Architecture · IEEE Trans. Computers 1991

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

node connectivity analysis · 0.0directed graph synthesis · 0.0
YearPublicationVenuePosition
1991 A Synthesis Approach to Design Optimally Fault Tolerant Network Architecture
abstract
A synthesis approach to the design of a class of regular networks which provide optimal fault tolerance and are of small diameter is presented. The approach makes it possible to design a regular network in the form of a directed graph when the number of nodes n and the number of connections per node d are given, for any n and d. The designed graph will have node connectivity d and a diameter proportional to (og/sub d/ n).>
Abhijit Sengupta, P. D. Joshi, Subir Bandyopadhyay
IEEE Trans. Computers2