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

Paul J. Hedrick

dblp:27/4595 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1997
—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 · 67% Electronic design automation · 33%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

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

TopicWeightPapersLastEvidence papers
Interconnection networks and networks-on-chip › interprocessor communication
all-to-all communication		 0.011997
Edge Congestion of Shortest Path Systems for All-to-All Communication · IEEE Trans. Parallel Distributed Syst. 1997
Interconnection networks and networks-on-chip › network contention
edge congestion		 0.011997
Edge Congestion of Shortest Path Systems for All-to-All Communication · IEEE Trans. Parallel Distributed Syst. 1997
Electronic design automation › physical design › routing › message routing
shortest-path routing		 0.011997
Edge Congestion of Shortest Path Systems for All-to-All Communication · IEEE Trans. Parallel Distributed Syst. 1997

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

factor routing · 0.0bisection width analysis · 0.0
YearPublicationVenuePosition
1997 Edge Congestion of Shortest Path Systems for All-to-All Communication
abstract
The problem of choosing a static shortest-path system that minimizes maximum edge congestion in a network is studied. Bounds based on parameters, such as diameter, bisection width, and average distance, are derived and conditions for producing uniform congestion on all edges are explored. Trees are shown to have maximum congestion on edges that are incident to a centroid node. Cartesian product graphs, which generalize multidimensional meshes, are shown to satisfy several closure properties and a generic factor-routing scheme is defined and shown to be optimal in many cases.
Charles M. Fiduccia, Paul J. Hedrick
 IEEE Trans. Parallel Distributed Syst.2