{"id":"https://openalex.org/W2111433703","doi":"https://doi.org/10.1109/tc.2003.1234524","title":"Adaptive algorithms for maximal diagnosis of wiring interconnects","display_name":"Adaptive algorithms for maximal diagnosis of wiring interconnects","publication_year":2003,"publication_date":"2003-10-01","ids":{"openalex":"https://openalex.org/W2111433703","doi":"https://doi.org/10.1109/tc.2003.1234524","mag":"2111433703"},"language":"en","primary_location":{"id":"doi:10.1109/tc.2003.1234524","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.2003.1234524","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100852727","display_name":"Wenyi Feng","orcid":null},"institutions":[{"id":"https://openalex.org/I116921496","display_name":"Lattice Semiconductor (United States)","ror":"https://ror.org/01hght844","country_code":"US","type":"company","lineage":["https://openalex.org/I116921496"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Wen-Yi Feng","raw_affiliation_strings":["Lattice Semiconductors, Bethlehem, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lattice Semiconductors, Bethlehem, PA, USA","institution_ids":["https://openalex.org/I116921496"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108394812","display_name":"F.J. Meyer","orcid":null},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"F.J. Meyer","raw_affiliation_strings":["Electrical and Computer Engineering Department, Northeastern University, Boston, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Department, Northeastern University, Boston, MA, USA","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001979328","display_name":"Fabrizio Lombardi","orcid":"https://orcid.org/0000-0003-3152-3245"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"F. Lombardi","raw_affiliation_strings":["Electrical and Computer Engineering Department, Northeastern University, Boston, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Department, Northeastern University, Boston, MA, USA","institution_ids":["https://openalex.org/I12912129"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.991,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.76749626,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"52","issue":"10","first_page":"1259","last_page":"1270"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T14117","display_name":"Integrated Circuits and Semiconductor Failure Analysis","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7873531579971313},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6860400438308716},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6541099548339844},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4920794367790222},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48318353295326233},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.44477295875549316},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.4289158582687378},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40151247382164},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24253767728805542}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7873531579971313},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6860400438308716},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6541099548339844},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4920794367790222},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48318353295326233},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.44477295875549316},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4289158582687378},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40151247382164},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24253767728805542},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tc.2003.1234524","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.2003.1234524","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W128123307","https://openalex.org/W167884504","https://openalex.org/W1524961204","https://openalex.org/W1976094682","https://openalex.org/W1979477906","https://openalex.org/W2059688607","https://openalex.org/W2100027596","https://openalex.org/W2102126685","https://openalex.org/W2104500469","https://openalex.org/W2110493715","https://openalex.org/W2115079718","https://openalex.org/W2117040048","https://openalex.org/W2125015298","https://openalex.org/W2135810034","https://openalex.org/W2151437197","https://openalex.org/W2162041076","https://openalex.org/W4242291917","https://openalex.org/W4285719527","https://openalex.org/W4300936028","https://openalex.org/W6605234255"],"related_works":["https://openalex.org/W3207760230","https://openalex.org/W1496222301","https://openalex.org/W1590307681","https://openalex.org/W4312814274","https://openalex.org/W4285370786","https://openalex.org/W2296488620","https://openalex.org/W2358353312","https://openalex.org/W2353836703","https://openalex.org/W41015297","https://openalex.org/W2151412766"],"abstract_inverted_index":{"We":[0,70],"give":[1],"two":[2,72,90],"algorithms":[3,74,80,118,136,139],"for":[4,100,125,140,154],"maximal":[5,141],"diagnosis":[6,18,142],"of":[7,20,44,145,148],"wiring":[8],"networks":[9],"without":[10],"repair":[11],"under":[12,25],"a":[13,97,114],"general":[14],"fault":[15],"model.":[16],"Maximal":[17],"consists":[19],"identifying":[21],"all":[22,55],"diagnosable":[23],"faults":[24],"the":[26,63,102,109,126,134,146,156,161],"assumptions":[27],"that":[28,133],"each":[29],"net":[30],"can":[31,38],"have":[32,85],"multiple":[33],"drivers":[34],"and":[35,37,46,59,67,75,84,159],"receivers":[36],"be":[39],"affected":[40],"by":[41],"any":[42],"number":[43,147],"short":[45],"open":[47],"faults.":[48],"This":[49],"process":[50],"is":[51,164],"equivalent":[52],"to":[53,113],"verifying":[54,101],"connections":[56,64],"between":[57],"inputs":[58],"outputs.":[60],"Matrices":[61],"represent":[62],"in":[65,143],"fault-free":[66],"faulty":[68],"networks.":[69],"present":[71],"new":[73,94,106],"discuss":[76],"prior":[77],"algorithms.":[78],"All":[79,117],"discussed":[81,119],"are":[82],"adaptive":[83],"their":[86],"tests":[87],"divided":[88],"into":[89],"phases.":[91],"Our":[92],"first":[93,127],"algorithm":[95,107],"exploits":[96],"unique":[98],"condition":[99],"connections;":[103],"our":[104],"second":[105],"maps":[108],"connection":[110],"verification":[111],"problem":[112],"bipartite":[115],"graph.":[116],"use":[120],"an":[121],"independent":[122],"test":[123,128,157],"set":[124],"phase.":[129],"Simulation":[130],"results":[131],"show":[132],"proposed":[135],"outperform":[137],"previous":[138],"terms":[144],"tests.":[149],"The":[150],"total":[151],"time":[152],"complexity":[153],"computing":[155],"sequences":[158],"analyzing":[160],"output":[162],"response":[163],"polynomial.":[165]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}