{"id":"https://openalex.org/W2113959782","doi":"https://doi.org/10.1145/1228784.1228800","title":"Robust wiring networks for DfY considering timing constraints","display_name":"Robust wiring networks for DfY considering timing constraints","publication_year":2007,"publication_date":"2007-03-11","ids":{"openalex":"https://openalex.org/W2113959782","doi":"https://doi.org/10.1145/1228784.1228800","mag":"2113959782"},"language":"en","primary_location":{"id":"doi:10.1145/1228784.1228800","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1228784.1228800","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th ACM Great Lakes symposium on VLSI","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/A5055278608","display_name":"P. Panitz","orcid":null},"institutions":[{"id":"https://openalex.org/I114112103","display_name":"Leibniz University Hannover","ror":"https://ror.org/0304hq317","country_code":"DE","type":"education","lineage":["https://openalex.org/I114112103"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Philipp V. Panitz","raw_affiliation_strings":["University of Hannover, Hannover, Germany","[University of Hannover, Hannover, Germany.]"],"affiliations":[{"raw_affiliation_string":"University of Hannover, Hannover, Germany","institution_ids":[]},{"raw_affiliation_string":"[University of Hannover, Hannover, Germany.]","institution_ids":["https://openalex.org/I114112103"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010238994","display_name":"Markus Olbrich","orcid":"https://orcid.org/0000-0001-9851-5982"},"institutions":[{"id":"https://openalex.org/I114112103","display_name":"Leibniz University Hannover","ror":"https://ror.org/0304hq317","country_code":"DE","type":"education","lineage":["https://openalex.org/I114112103"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Markus Olbrich","raw_affiliation_strings":["University of Hannover, Hannover, Germany","[University of Hannover, Hannover, Germany.]"],"affiliations":[{"raw_affiliation_string":"University of Hannover, Hannover, Germany","institution_ids":[]},{"raw_affiliation_string":"[University of Hannover, Hannover, Germany.]","institution_ids":["https://openalex.org/I114112103"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057367287","display_name":"Erich Barke","orcid":"https://orcid.org/0000-0001-5744-2940"},"institutions":[{"id":"https://openalex.org/I114112103","display_name":"Leibniz University Hannover","ror":"https://ror.org/0304hq317","country_code":"DE","type":"education","lineage":["https://openalex.org/I114112103"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Erich Barke","raw_affiliation_strings":["University of Hannover, Hannover, Germany","[University of Hannover, Hannover, Germany.]"],"affiliations":[{"raw_affiliation_string":"University of Hannover, Hannover, Germany","institution_ids":[]},{"raw_affiliation_string":"[University of Hannover, Hannover, Germany.]","institution_ids":["https://openalex.org/I114112103"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111365730","display_name":"J\u00fcrgen Koehl","orcid":null},"institutions":[{"id":"https://openalex.org/I4210095996","display_name":"IBM (Germany)","ror":"https://ror.org/00pm7rm97","country_code":"DE","type":"company","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210095996"]},{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["DE","US"],"is_corresponding":false,"raw_author_name":"J\u00fcrgen Koehl","raw_affiliation_strings":["IBM Deutschland Entwicklung GmbH, Boeblingen, Germany","IBM Deutschland Entwicklung GmbH, Boeblingen, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"IBM Deutschland Entwicklung GmbH, Boeblingen, Germany","institution_ids":["https://openalex.org/I4210095996"]},{"raw_affiliation_string":"IBM Deutschland Entwicklung GmbH, Boeblingen, Germany#TAB#","institution_ids":["https://openalex.org/I1341412227"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5055278608"],"corresponding_institution_ids":["https://openalex.org/I114112103"],"apc_list":null,"apc_paid":null,"fwci":2.8099,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.90555389,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"43","last_page":"48"},"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":1.0,"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":1.0,"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/robustness","display_name":"Robustness (evolution)","score":0.8453166484832764},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6762086749076843},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6494841575622559},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5983165502548218},{"id":"https://openalex.org/keywords/network-routing","display_name":"Network routing","score":0.5878261923789978},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.48727643489837646},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.4822476804256439},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38029518723487854},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.34675925970077515},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2241460084915161},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16883313655853271},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.16875672340393066}],"concepts":[{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.8453166484832764},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6762086749076843},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6494841575622559},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5983165502548218},{"id":"https://openalex.org/C2983435990","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Network routing","level":3,"score":0.5878261923789978},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.48727643489837646},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.4822476804256439},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38029518723487854},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.34675925970077515},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2241460084915161},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16883313655853271},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.16875672340393066},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1228784.1228800","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1228784.1228800","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th ACM Great Lakes symposium on VLSI","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":16,"referenced_works":["https://openalex.org/W170913323","https://openalex.org/W571322228","https://openalex.org/W1486993561","https://openalex.org/W1535812334","https://openalex.org/W1541536235","https://openalex.org/W1578824783","https://openalex.org/W2012746686","https://openalex.org/W2069441127","https://openalex.org/W2115045277","https://openalex.org/W2122658077","https://openalex.org/W2126226073","https://openalex.org/W2154545967","https://openalex.org/W2163626738","https://openalex.org/W2168150082","https://openalex.org/W2542641932","https://openalex.org/W6653705561"],"related_works":["https://openalex.org/W2075067217","https://openalex.org/W2149224531","https://openalex.org/W4254709952","https://openalex.org/W2026034687","https://openalex.org/W1687060458","https://openalex.org/W2137646787","https://openalex.org/W4247716783","https://openalex.org/W2160885658","https://openalex.org/W2098791961","https://openalex.org/W2103006090"],"abstract_inverted_index":{"In":[0],"nanometer":[1],"technologies":[2],"the":[3,66],"importance":[4],"of":[5],"opens":[6],"as":[7],"yield":[8],"detractors":[9],"considerably":[10],"increases.":[11],"This":[12],"requires":[13],"to":[14,46],"reconsider":[15],"traditional":[16],"tree":[17],"based":[18],"routing":[19,47],"approaches":[20],"for":[21],"signal":[22],"wiring.":[23],"We":[24],"propose":[25],"a":[26,73],"Greedy":[27],"Minimum":[28],"Routing":[29],"Tree":[30],"Augmentation":[31],"(GMRTA)":[32],"algorithm":[33,43,77],"that":[34,58],"shows":[35],"significantly":[36],"better":[37],"results":[38],"than":[39],"previous":[40,87],"approaches.":[41],"The":[42],"adds":[44],"links":[45],"trees,":[48],"thus":[49],"increases":[50],"its":[51],"robustness":[52],"against":[53],"open":[54],"defects.":[55],"By":[56],"exploiting":[57],"edges":[59],"in":[60],"multiple":[61],"loops":[62],"can":[63],"be":[64],"removed":[65],"augmentation":[67],"efficiency":[68],"is":[69],"further":[70],"improved.":[71],"As":[72],"special":[74],"feature,":[75],"our":[76],"keeps":[78],"timing":[79],"constraints":[80],"which":[81],"have":[82],"not":[83],"been":[84],"considered":[85],"by":[86],"GMRTA":[88],"algorithms.":[89]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}