BibTeX record conf/itc/QiuW03

download as .bib file

@inproceedings{DBLP:conf/itc/QiuW03,
  author       = {Wangqi Qiu and
                  D. M. H. Walker},
  title        = {An Efficient Algorithm for Finding the {K} Longest Testable Paths
                  Through Each Gate in a Combinational Circuit},
  booktitle    = {Proceedings 2003 International Test Conference {(ITC} 2003), Breaking
                  Test Interface Bottlenecks, 28 September - 3 October 2003, Charlotte,
                  NC, {USA}},
  pages        = {592--601},
  publisher    = {{IEEE} Computer Society},
  year         = {2003},
  url          = {https://doi.org/10.1109/TEST.2003.1270886},
  doi          = {10.1109/TEST.2003.1270886},
  timestamp    = {Thu, 23 Mar 2023 23:58:42 +0100},
  biburl       = {https://dblp.org/rec/conf/itc/QiuW03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.