"An Efficient Algorithm for Finding the K Longest Testable Paths Through ..."

Wangqi Qiu, D. M. H. Walker (2003)

> Home

Details and statistics

DOI: 10.1109/TEST.2003.1270886

access: closed

type: Conference or Workshop Paper

metadata version: 2023-03-23

- view
  authority control:
- export record
  dblp key:
  - conf/itc/QiuW03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/itc/QiuW03
Wangqi Qiu, D. M. H. Walker:
An Efficient Algorithm for Finding the K Longest Testable Paths Through Each Gate in a Combinational Circuit. ITC 2003: 592-601

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.