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

Y. Pan

dblp:71/4428 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2005
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2

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 · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › physical design › routing
global routing		 0.011987
A Path Selection Global Router · DAC 1987
Electronic design automation
path selection		 0.011987
A Path Selection Global Router · DAC 1987
Electronic design automation
physical design		 0.011987
A Path Selection Global Router · DAC 1987
Electronic design automation › physical design
routing		 0.011987
A Path Selection Global Router · DAC 1987

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

heuristic search · 0.0
YearPublicationVenuePosition
2005 Simple Available Bandwidth Utilization Library for High-Speed Wide Area Networks
Robert L. Grossman, Marco Mazzucco, Harimath Sivakumar, Y. Pan
 J. Supercomput.4
1987 A Path Selection Global Router
abstract
In this paper, a new path selection heuristic search algorithm is proposed for connecting two components of vertices. A novel feature of the algorithm is that the active terminals (vertices in the net which are not yet connected) are modeled as magnets during the path searching process. The heuristic search algorithm is applied to two commonly used multi-terminal net tree connection algorithms. Experimental results show that the new path selection heuristic search algorithm is better than the other algorithms which do not consider the active terminals.
Y. C. Hsu, Y. Pan, William J. Kubitz
 DAC2