{"id":"https://openalex.org/W3141445985","doi":"https://doi.org/10.1109/aspdac.2006.1594782","title":"SAT-based optimal hypergraph partitioning with replication","display_name":"SAT-based optimal hypergraph partitioning with replication","publication_year":2006,"publication_date":"2006-03-22","ids":{"openalex":"https://openalex.org/W3141445985","doi":"https://doi.org/10.1109/aspdac.2006.1594782","mag":"3141445985"},"language":"en","primary_location":{"id":"doi:10.1109/aspdac.2006.1594782","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aspdac.2006.1594782","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/A5073003643","display_name":"Michael G. Wrighton","orcid":null},"institutions":[{"id":"https://openalex.org/I2800679380","display_name":"Fistula Foundation","ror":"https://ror.org/03aw9bj44","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I2800679380"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"M.G. Wrighton","raw_affiliation_strings":["Tabula, Inc., Santa Clara, CA, USA"],"affiliations":[{"raw_affiliation_string":"Tabula, Inc., Santa Clara, CA, USA","institution_ids":["https://openalex.org/I2800679380"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087585086","display_name":"Andr\u00e9 DeHon","orcid":"https://orcid.org/0000-0001-9177-7699"},"institutions":[{"id":"https://openalex.org/I122411786","display_name":"California Institute of Technology","ror":"https://ror.org/05dxps055","country_code":"US","type":"education","lineage":["https://openalex.org/I122411786"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A.M. DeHon","raw_affiliation_strings":["Computer Science, California Institute of Technology, Pasadena, CA, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science, California Institute of Technology, Pasadena, CA, USA","institution_ids":["https://openalex.org/I122411786"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5073003643"],"corresponding_institution_ids":["https://openalex.org/I2800679380"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.39693014,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"16","issue":null,"first_page":"789","last_page":"795"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9991999864578247,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9991999864578247,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9980999827384949,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.8034454584121704},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.6999388337135315},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6941055059432983},{"id":"https://openalex.org/keywords/replication","display_name":"Replication (statistics)","score":0.6792678236961365},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6410535573959351},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.48896777629852295},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45418867468833923},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3655533492565155},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33954185247421265},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2823105752468109},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.20652183890342712}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.8034454584121704},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6999388337135315},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6941055059432983},{"id":"https://openalex.org/C12590798","wikidata":"https://www.wikidata.org/wiki/Q3933199","display_name":"Replication (statistics)","level":2,"score":0.6792678236961365},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6410535573959351},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.48896777629852295},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45418867468833923},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3655533492565155},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33954185247421265},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2823105752468109},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.20652183890342712},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/aspdac.2006.1594782","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aspdac.2006.1594782","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":17,"referenced_works":["https://openalex.org/W1541981281","https://openalex.org/W1576377586","https://openalex.org/W1923495615","https://openalex.org/W2011039300","https://openalex.org/W2033937366","https://openalex.org/W2100382302","https://openalex.org/W2105715355","https://openalex.org/W2115762048","https://openalex.org/W2150281391","https://openalex.org/W2150649896","https://openalex.org/W4230469400","https://openalex.org/W4231025808","https://openalex.org/W4239914453","https://openalex.org/W4243467301","https://openalex.org/W6634450156","https://openalex.org/W6682415309","https://openalex.org/W6825713691"],"related_works":["https://openalex.org/W1970590090","https://openalex.org/W3176904788","https://openalex.org/W21597398","https://openalex.org/W2091617677","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W1913543287","https://openalex.org/W2268872489","https://openalex.org/W2963044240","https://openalex.org/W2076399409"],"abstract_inverted_index":{"We":[0,16,38,87],"propose":[1],"a":[2],"methodology":[3],"for":[4,70,90],"optimal":[5,44,68],"k-way":[6],"partitioning":[7,45,71,113],"with":[8,72,104],"replication":[9,106],"of":[10,22,52,83,99,109,127],"directed":[11],"hypergraphs":[12],"via":[13],"Boolean":[14],"satisfiability.":[15],"begin":[17],"by":[18],"leveraging":[19],"the":[20,42,65,75,81,91],"power":[21],"existing":[23],"and":[24,33,50,80],"emerging":[25],"SAT":[26],"solvers":[27],"to":[28,40,74,101,118,122],"attack":[29],"traditional":[30],"logic":[31],"bipartitioning":[32,92],"show":[34,88],"good":[35],"scaling":[36],"behavior.":[37],"continue":[39],"present":[41],"first":[43,66],"results":[46,69],"that":[47,61,89],"admit":[48],"generation":[49],"assignment":[51],"replicated":[53],"nodes":[54,103,124],"concurrently.":[55],"Our":[56],"framework":[57],"is":[58],"general":[59],"enough":[60],"we":[62,94,115],"also":[63],"give":[64],"published":[67],"respect":[73],"maximum":[76],"subdomain":[77],"degree":[78],"metric":[79],"sum":[82],"external":[84],"degrees":[85],"metric.":[86],"case":[93],"can":[95],"feasibly":[96],"solve":[97,119],"problems":[98,120],"up":[100,121],"150":[102],"simultaneous":[105],"in":[107,125],"hundreds":[108,126],"seconds.":[110],"For":[111],"other":[112],"metrics,":[114],"are":[116],"able":[117],"40":[123],"seconds":[128]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}