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

S. H. Yen

dblp:88/2274 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1989
—ORCID · none

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

Systems, architecture and hardware · 2 · 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
2 papers
Electronic design automation · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation
timing analysis		 0.021989
Efficient Algorithms for Extracting the K most Critical Paths in Timing Analysis · DAC 1989
On the General False Path Problem in Timing Analysis · DAC 1989
Electronic design automation › timing analysis
critical path generation		 0.011989
Efficient Algorithms for Extracting the K most Critical Paths in Timing Analysis · DAC 1989
Electronic design automation › timing analysis
false path analysis		 0.011989
On the General False Path Problem in Timing Analysis · DAC 1989
Electronic design automation › timing analysis › path analysis
path delay analysis		 0.011989
On the General False Path Problem in Timing Analysis · DAC 1989

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

path extraction algorithm · 0.0false path detection algorithm · 0.0
YearPublicationVenuePosition
1989 On the General False Path Problem in Timing Analysis
abstract
The false path problem is often referred to as the problem of detecting the longest sensitizable path (A path which is not a false path is a sensitizable path). The term “false path” is not clearly defined. In this paper, we first give a clear and precise definition of a false path. Then the general false path problem is formulated. The general false path problem is to detect whether a given path (not necessarily the longest one) is a false path. We present an efficient algorithm for solving the general false path problem. We also propose another algorithm which generates all the possible sensitizable paths with the delays greater than a given threshold T. The efficiency and effectiveness of the proposed algorithm are demonstrated by the experimental results.
David Hung-Chang Du, S. H. Yen, Subbarao Ghanta
 DAC2
1989 Efficient Algorithms for Extracting the K most Critical Paths in Timing Analysis
abstract
Path extracting algorithms are a very important part of timing analysis approach. In this paper we designed and developed several algorithms which can generate the K most critical paths in a non-increasing order of their delays. The effectiveness of these algorithms is shown by some experimental results.
S. H. Yen, David Hung-Chang Du, Subbarao Ghanta
 DAC1