{"id":"https://openalex.org/W4254117933","doi":"https://doi.org/10.1109/aspdac.2006.1594810","title":"Statistical bellman-ford algorithm with an application to retiming","display_name":"Statistical bellman-ford algorithm with an application to retiming","publication_year":2006,"publication_date":"2006-03-22","ids":{"openalex":"https://openalex.org/W4254117933","doi":"https://doi.org/10.1109/aspdac.2006.1594810"},"language":"en","primary_location":{"id":"doi:10.1109/aspdac.2006.1594810","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aspdac.2006.1594810","pdf_url":null,"source":{"id":"https://openalex.org/S4363608292","display_name":"Asia and South Pacific Conference on Design Automation, 2006.","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Asia and South Pacific Conference on Design Automation, 2006.","raw_type":"proceedings-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/A5020698567","display_name":"M. Ekpanyapong","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"M. Ekpanyapong","raw_affiliation_strings":["School of Electrical and Computer Engineering, Georgia Institute of Technology, USA"],"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, Georgia Institute of Technology, USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005018156","display_name":"Thaisiri Waterwai","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"T. Waterwai","raw_affiliation_strings":["Georgia Institute of Technology, Atlanta, GA, US"],"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology, Atlanta, GA, US","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052950521","display_name":"Sung Kyu Lim","orcid":"https://orcid.org/0000-0002-2267-5282"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sung Kyu Lim","raw_affiliation_strings":["School of Electrical and Computer Engineering, Georgia Institute of Technology, USA"],"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, Georgia Institute of Technology, USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5020698567"],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.53493043,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"959","last_page":"964"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.9998999834060669,"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/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.9998999834060669,"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/retiming","display_name":"Retiming","score":0.9390444755554199},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7223374843597412},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6854487657546997},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6409003734588623},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.5026381015777588},{"id":"https://openalex.org/keywords/sequential-logic","display_name":"Sequential logic","score":0.500774621963501},{"id":"https://openalex.org/keywords/statistic","display_name":"Statistic","score":0.4479948878288269},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4363267123699188},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.41113513708114624},{"id":"https://openalex.org/keywords/logic-gate","display_name":"Logic gate","score":0.2758446931838989},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.19430240988731384},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.18593838810920715},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17858010530471802},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10365617275238037},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09363380074501038}],"concepts":[{"id":"https://openalex.org/C41112130","wikidata":"https://www.wikidata.org/wiki/Q2146175","display_name":"Retiming","level":2,"score":0.9390444755554199},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7223374843597412},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6854487657546997},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6409003734588623},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.5026381015777588},{"id":"https://openalex.org/C187075797","wikidata":"https://www.wikidata.org/wiki/Q173245","display_name":"Sequential logic","level":3,"score":0.500774621963501},{"id":"https://openalex.org/C89128539","wikidata":"https://www.wikidata.org/wiki/Q1949963","display_name":"Statistic","level":2,"score":0.4479948878288269},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4363267123699188},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.41113513708114624},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.2758446931838989},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19430240988731384},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.18593838810920715},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17858010530471802},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10365617275238037},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09363380074501038},{"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/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/aspdac.2006.1594810","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aspdac.2006.1594810","pdf_url":null,"source":{"id":"https://openalex.org/S4363608292","display_name":"Asia and South Pacific Conference on Design Automation, 2006.","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Asia and South Pacific Conference on Design Automation, 2006.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1507979178","https://openalex.org/W2056099894","https://openalex.org/W2100201046","https://openalex.org/W2126419962","https://openalex.org/W2129183345","https://openalex.org/W2142599304","https://openalex.org/W2158750015","https://openalex.org/W2576544140","https://openalex.org/W4238424602","https://openalex.org/W4240226712","https://openalex.org/W4242736193","https://openalex.org/W4243164749"],"related_works":["https://openalex.org/W4248668797","https://openalex.org/W2111485030","https://openalex.org/W4250455229","https://openalex.org/W2062802485","https://openalex.org/W2169017341","https://openalex.org/W2155487883","https://openalex.org/W2126468650","https://openalex.org/W1984491986","https://openalex.org/W3143422391","https://openalex.org/W2169417961"],"abstract_inverted_index":{"Process":[0],"variations":[1],"in":[2],"digital":[3],"circuits":[4,155],"make":[5],"sequential":[6,154],"circuit":[7,58],"timing":[8],"validation":[9],"an":[10],"extremely":[11],"challenging":[12],"task.":[13],"In":[14],"this":[15,138],"paper,":[16],"a":[17,63,88],"Statistical":[18,72],"Bellman-Ford":[19],"(SBF)":[20],"algorithm":[21,38,152],"is":[22,59,71,80,122,139],"proposed":[23],"to":[24,61,82,124],"compute":[25],"the":[26,41,57,85,112,126,133,140,145,149],"longest":[27,43,150],"path":[28,44,116,151],"length":[29,45],"distribution":[30,46,93,101],"for":[31,84,94,153],"directed":[32],"graphs":[33],"with":[34],"cycles.":[35],"Our":[36,96],"SBF":[37,70,79,130],"efficiently":[39],"computes":[40],"statistical":[42],"if":[47,56],"there":[48],"exist":[49],"no":[50],"positive":[51,64],"cycles":[52],"or":[53],"detects":[54],"one":[55],"likely":[60],"have":[62],"cycle.":[65],"An":[66],"important":[67],"application":[68],"of":[69,87,128,135,148],"Retiming":[73],"based":[74],"Timing":[75],"Analysis":[76],"(SRTA),":[77],"where":[78],"used":[81,123],"check":[83],"feasibility":[86],"given":[89],"target":[90],"clock":[91],"period":[92],"retiming.":[95],"gate":[97],"and":[98,109,114],"wire":[99],"delay":[100],"model":[102],"considers":[103],"several":[104],"high-impact":[105],"intra-die":[106],"process":[107],"parameters":[108],"accurately":[110],"captures":[111],"spatial":[113],"reconvergent":[115],"correlations.":[117],"The":[118],"Monte":[119],"Carlo":[120],"simulation":[121],"validate":[125],"accuracy":[127],"our":[129,136],"algorithm.":[131],"To":[132],"best":[134],"knowledge,":[137],"first":[141],"paper":[142],"that":[143],"propose":[144],"statistic":[146],"version":[147]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}