{"id":"https://openalex.org/W2000688936","doi":"https://doi.org/10.1109/tvlsi.2012.2218136","title":"Concurrent Path Selection Algorithm in Statistical Timing Analysis","display_name":"Concurrent Path Selection Algorithm in Statistical Timing Analysis","publication_year":2012,"publication_date":"2012-10-11","ids":{"openalex":"https://openalex.org/W2000688936","doi":"https://doi.org/10.1109/tvlsi.2012.2218136","mag":"2000688936"},"language":"en","primary_location":{"id":"doi:10.1109/tvlsi.2012.2218136","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tvlsi.2012.2218136","pdf_url":null,"source":{"id":"https://openalex.org/S37538908","display_name":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","issn_l":"1063-8210","issn":["1063-8210","1557-9999"],"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 Very Large Scale Integration (VLSI) Systems","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/A5006563419","display_name":"Jaeyong Chung","orcid":"https://orcid.org/0000-0001-5819-1995"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jaeyong Chung","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Texas, Austin, TX, USA","Dept. of Electr. & Comput. Eng., Univ. of Texas, Austin, TX, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Texas, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Univ. of Texas, Austin, TX, USA#TAB#","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068070739","display_name":"Jacob A. Abraham","orcid":"https://orcid.org/0000-0002-5336-5631"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jacob A. Abraham","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Texas, Austin, TX, USA","Dept. of Electr. & Comput. Eng., Univ. of Texas, Austin, TX, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Texas, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Univ. of Texas, Austin, TX, USA#TAB#","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.08327936,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"21","issue":"9","first_page":"1715","last_page":"1726"},"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.9998999834060669,"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.9998999834060669,"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.9976000189781189,"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9954000115394592,"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/path","display_name":"Path (computing)","score":0.6766002774238586},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5812225341796875},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5674394965171814},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5344164967536926},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.526557445526123},{"id":"https://openalex.org/keywords/static-timing-analysis","display_name":"Static timing analysis","score":0.49896669387817383},{"id":"https://openalex.org/keywords/fast-path","display_name":"Fast path","score":0.46994975209236145},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.44277673959732056},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.4401957094669342},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29184895753860474},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.20443356037139893},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.1711016297340393},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1376241147518158}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6766002774238586},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5812225341796875},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5674394965171814},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5344164967536926},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.526557445526123},{"id":"https://openalex.org/C93682380","wikidata":"https://www.wikidata.org/wiki/Q2025226","display_name":"Static timing analysis","level":2,"score":0.49896669387817383},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.46994975209236145},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.44277673959732056},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.4401957094669342},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29184895753860474},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.20443356037139893},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.1711016297340393},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1376241147518158},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","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},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tvlsi.2012.2218136","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tvlsi.2012.2218136","pdf_url":null,"source":{"id":"https://openalex.org/S37538908","display_name":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","issn_l":"1063-8210","issn":["1063-8210","1557-9999"],"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 Very Large Scale Integration (VLSI) Systems","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":37,"referenced_works":["https://openalex.org/W1518705996","https://openalex.org/W1966741973","https://openalex.org/W1996808256","https://openalex.org/W2007068450","https://openalex.org/W2095804030","https://openalex.org/W2098171066","https://openalex.org/W2099111195","https://openalex.org/W2112008841","https://openalex.org/W2115483211","https://openalex.org/W2116739712","https://openalex.org/W2117953147","https://openalex.org/W2119130057","https://openalex.org/W2120116751","https://openalex.org/W2125930326","https://openalex.org/W2126324865","https://openalex.org/W2130861008","https://openalex.org/W2137012712","https://openalex.org/W2143847170","https://openalex.org/W2145522570","https://openalex.org/W2151556394","https://openalex.org/W2153799652","https://openalex.org/W2154665706","https://openalex.org/W2156306402","https://openalex.org/W2158137510","https://openalex.org/W2159006760","https://openalex.org/W2161156282","https://openalex.org/W2166294071","https://openalex.org/W2167253897","https://openalex.org/W2171709869","https://openalex.org/W4235221304","https://openalex.org/W4246922879","https://openalex.org/W4252889160","https://openalex.org/W4253603996","https://openalex.org/W4254506919","https://openalex.org/W6652326208","https://openalex.org/W6678610202","https://openalex.org/W6681354857"],"related_works":["https://openalex.org/W2116465486","https://openalex.org/W830396839","https://openalex.org/W3196508834","https://openalex.org/W2171940562","https://openalex.org/W2101572961","https://openalex.org/W2490317825","https://openalex.org/W2154884030","https://openalex.org/W2107199004","https://openalex.org/W3031443042","https://openalex.org/W4293070556"],"abstract_inverted_index":{"Circuit":[0],"timing":[1,21,30],"is":[2,86,146],"becoming":[3],"more":[4,6],"and":[5,23,101,200],"uncertain":[7],"under":[8],"greater":[9],"process":[10],"variation":[11],"as":[12],"technology":[13],"scales.":[14],"Given":[15],"the":[16,32,44,56,78,95,115,120,137,150,156,170,176,187,197],"fault":[17],"probability":[18],"of":[19,46,50,58,83,91,114,122],"each":[20,110,123],"path":[22,33,74,99,111,124,181],"their":[24,162],"statistical":[25,29],"correlation":[26,177],"from":[27,77],"a":[28,40,48,71,89],"framework,":[31],"selection":[34,75,82],"problem":[35,45],"for":[36],"delay":[37],"faults":[38],"has":[39],"nature":[41],"similar":[42],"to":[43,62,69,139,178,204],"designing":[47],"portfolio":[49],"stocks":[51],"or":[52,54,164],"assets":[53],"determining":[55],"size":[57],"bets":[59],"in":[60,88,109,136],"gambling":[61],"minimize":[63],"risk.":[64],"This":[65],"observation":[66],"allows":[67],"us":[68],"develop":[70],"very":[72],"different":[73],"approach":[76],"conventional":[79],"ones.":[80],"If":[81],"k":[84,116],"paths":[85,105,117,138,151],"required":[87],"set":[90,96,112,125],"paths,":[92,199],"we":[93,185],"partition":[94],"into":[97,155],"two":[98],"sets":[100],"determine":[102],"how":[103],"many":[104],"should":[106],"be":[107,140],"selected":[108,198],"out":[113],"based":[118,160],"on":[119,161,196],"probabilities":[121],"containing":[126],"faulty":[127],"paths.":[128],"We":[129],"recursively":[130],"continue":[131],"this":[132],"process,":[133],"which":[134],"results":[135,167],"targeted":[141],"during":[142],"tests.":[143],"The":[144],"partitioning":[145],"easily":[147],"performed":[148],"because":[149],"are":[152],"already":[153],"grouped":[154],"depth-first":[157],"search":[158],"tree":[159],"suffix":[163],"prefix.":[165],"Experimental":[166],"show":[168],"that":[169,189],"proposed":[171],"algorithm":[172],"can":[173],"effectively":[174],"use":[175],"generate":[179],"high-quality":[180],"sets.":[182],"In":[183],"addition,":[184],"study":[186],"issues":[188],"occur":[190],"after":[191],"automatic":[192],"test":[193],"pattern":[194],"generation":[195],"discuss":[201],"possible":[202],"solutions":[203],"them.":[205]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}