{"id":"https://openalex.org/W2141557308","doi":"https://doi.org/10.1145/1531542.1531624","title":"Timing-driven N-way decomposition","display_name":"Timing-driven N-way decomposition","publication_year":2009,"publication_date":"2009-05-10","ids":{"openalex":"https://openalex.org/W2141557308","doi":"https://doi.org/10.1145/1531542.1531624","mag":"2141557308"},"language":"en","primary_location":{"id":"doi:10.1145/1531542.1531624","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1531542.1531624","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 19th ACM Great Lakes symposium on VLSI","raw_type":"proceedings-article"},"type":"conference-paper","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/A5084806540","display_name":"David Ba\u00f1eres","orcid":"https://orcid.org/0000-0002-0380-1319"},"institutions":[{"id":"https://openalex.org/I138847295","display_name":"Universitat Oberta de Catalunya","ror":"https://ror.org/01f5wp925","country_code":"ES","type":"education","lineage":["https://openalex.org/I138847295"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"David Baneres","raw_affiliation_strings":["Universitat Oberta de Catalunya, Barcelona, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universitat Oberta de Catalunya, Barcelona, Spain","institution_ids":["https://openalex.org/I138847295"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031451250","display_name":"Jordi Cortadella","orcid":"https://orcid.org/0000-0001-8114-250X"},"institutions":[{"id":"https://openalex.org/I9617848","display_name":"Universitat Polit\u00e8cnica de Catalunya","ror":"https://ror.org/03mb6wj31","country_code":"ES","type":"education","lineage":["https://openalex.org/I9617848"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Jordi Cortadella","raw_affiliation_strings":["Universitat Polit\u00e8cnica de Catalunya, Barcelona, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universitat Polit\u00e8cnica de Catalunya, Barcelona, Spain","institution_ids":["https://openalex.org/I9617848"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110756486","display_name":"Mike Kishinevsky","orcid":null},"institutions":[{"id":"https://openalex.org/I1343180700","display_name":"Intel (United States)","ror":"https://ror.org/01ek73717","country_code":"US","type":"company","lineage":["https://openalex.org/I1343180700"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mike Kishinevsky","raw_affiliation_strings":["Strategic CAD Lab, Intel Corporation, Hillsboro, OR, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Strategic CAD Lab, Intel Corporation, Hillsboro, OR, USA","institution_ids":["https://openalex.org/I1343180700"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"363","last_page":"368"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9990000128746033,"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9977999925613403,"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/netlist","display_name":"Netlist","score":0.9462794065475464},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.8529120683670044},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5937813520431519},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5529688000679016},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5355605483055115},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.5154593586921692},{"id":"https://openalex.org/keywords/logic-synthesis","display_name":"Logic synthesis","score":0.5140446424484253},{"id":"https://openalex.org/keywords/decomposition-method","display_name":"Decomposition method (queueing theory)","score":0.4834802746772766},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4823300540447235},{"id":"https://openalex.org/keywords/logic-gate","display_name":"Logic gate","score":0.4061443507671356},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3796939253807068},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2818804383277893},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.13498419523239136},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.11566922068595886},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.09769445657730103}],"concepts":[{"id":"https://openalex.org/C177650935","wikidata":"https://www.wikidata.org/wiki/Q1760303","display_name":"Netlist","level":2,"score":0.9462794065475464},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.8529120683670044},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5937813520431519},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5529688000679016},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5355605483055115},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.5154593586921692},{"id":"https://openalex.org/C157922185","wikidata":"https://www.wikidata.org/wiki/Q173198","display_name":"Logic synthesis","level":3,"score":0.5140446424484253},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.4834802746772766},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4823300540447235},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.4061443507671356},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3796939253807068},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2818804383277893},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.13498419523239136},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.11566922068595886},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.09769445657730103},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1531542.1531624","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1531542.1531624","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 19th ACM Great Lakes symposium on VLSI","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.517.8078","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.517.8078","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lsi.upc.edu/~jordicf/gavina/BIB/files/baneres_glvlsi09.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.883.5030","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.883.5030","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.researchgate.net/profile/Jordi_Cortadella/publication/220903911_Timing-driven_N-way_decomposition/links/0912f50bcafe913f85000000.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W196895893","https://openalex.org/W1486898914","https://openalex.org/W1500590019","https://openalex.org/W1548459443","https://openalex.org/W1551597857","https://openalex.org/W2007701500","https://openalex.org/W2100921984","https://openalex.org/W2112549062","https://openalex.org/W2130825721","https://openalex.org/W2141110932","https://openalex.org/W2149693580","https://openalex.org/W2154275811","https://openalex.org/W2165643425","https://openalex.org/W2170003961","https://openalex.org/W4285719527","https://openalex.org/W6629166896","https://openalex.org/W6633040918"],"related_works":["https://openalex.org/W2109670648","https://openalex.org/W2120655977","https://openalex.org/W2000778050","https://openalex.org/W4233234973","https://openalex.org/W2157874690","https://openalex.org/W2540275465","https://openalex.org/W1964556228","https://openalex.org/W1987793178","https://openalex.org/W1925985328","https://openalex.org/W3143952996"],"abstract_inverted_index":{"Logic":[0],"decomposition":[1,44,52],"has":[2],"been":[3],"extensively":[4],"used":[5],"to":[6,26,34,68],"optimize":[7],"the":[8,12,15,23,28,31,35,74,78,90],"worst-case":[9],"delay":[10,79],"and":[11,101],"area":[13],"in":[14,83],"technology":[16,107],"independent":[17],"phase.":[18],"Bi-decomposition":[19],"is":[20,53,87,96,109],"one":[21],"of":[22,30,51,64],"state-of-art":[24],"techniques":[25],"reduce":[27],"depth":[29],"netlist":[32],"due":[33],"affordable":[36],"computational":[37],"cost.":[38],"We":[39],"present":[40],"a":[41,56,61,93],"novel":[42],"n-way":[43],"technique":[45],"that":[46],"improves":[47,77],"bi-decomposition.":[48,69],"The":[49,70],"problem":[50],"formulated":[54],"as":[55],"Boolean":[57,75],"relation":[58,76],"which":[59,106],"captures":[60],"larger":[62,103],"set":[63],"possible":[65],"solutions":[66],"compared":[67],"solution":[71],"obtained":[72],"from":[73],"with":[80],"near-zero":[81],"cost":[82],"area.":[84],"As":[85],"it":[86],"shown":[88],"on":[89,98,105],"experimental":[91],"results,":[92],"considerable":[94],"improvement":[95],"achieved":[97],"large":[99],"netlists":[100],"even":[102],"depending":[104],"mapper":[108],"used.":[110]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}